Login
Logged in as anonymous /
My BiBiServ
/
Logout
Search
?
Navigation
Tools
Alignment
AltAVist
ClustalW
dca
Dialign
E2G
JAli
OMA
PoSSuMsearch
PoSSuMsearch2
SWIFT Suit
Evolutionary Relationships
ConCysFind
Roci
ROCOCO
Rose
SplitsTree
Genome Comparison
AGenDA
AggloIndel
CEGeD
CG-CAT
DCJ
FFGC
Gecko
GEvolutionS
GraphTeams
MGA
newdist
REPuter
SBBI
TCRProfiler
Others
acdc
AGT-SDP
AIM
BPR
Decomp
Fly_Pres
Intronserter
jPREdictor
libfid
Metrans
mkESA
mmfind
MoRAine
Phase4
PREdictor
SciBrow
TALP
Trace2PS
Unwords
Wotd
XenDB
Primer Design
genefisher2
RNA
Shapes Studio
KnotInFrame
pAliKiss
pKiss
pknotsRG
RapidShapes
RNAalishapes
RNAshapes
aCMs
GUUGle
InSilicoDicer
Locomotif
paRNAss
planACstar
RNAforester
RNAhybrid
RNAsifter
Previous Results
Framework/Cloud
Education
Dynamic Programming
ADP
Sequence Analysis
SADR
Administration
BiBiServ policies
BiBiServ Team
Impressum
license
privacy policy
Statuscodes
Wotd
Welcome
Download
References
Authors: S. Kurtz, R. Giegerich, J. Stoye
Wotd is an implementation of the ''lazy'' write-only top-down construction algorithm of suffix trees using a very space-efficient representation.
Users of Wotd are requested to cite :
Giegerich, Robert and Kurtz, Stefan and Stoye, Jens
Efficient implementation of lazy suffix trees
, Software - Practise and Experience, 2003
built on March 4 2015 (1:d0ba4790fd33)
PoSSuMsearch2
SWIFT Suit
GEvolutionS
PREdictor
pKiss
Bellman's GAP Cafe
RNAalishapes
RNAshapes
paRNAss
BPR
genefisher2
mmfind
mkESA
AGT-SDP
DCJ
Metrans
RapidShapes
MoRAine
AIM
newdist
JAli
Rose
Download
privacy policy
ROCOCO
E2G
Welcome
OMA
SplitsTree
CG-CAT
SciBrow
GraphTeams
RNAhybrid
SADR
KnotInFrame
AltAVist
Fly_Pres
Welcome
planACstar
Unwords
CEGeD
Wotd
RNAsifter
Trace2PS
Wotd
aCMs
ConCysFind
Roci
jPREdictor
ADP
dca
Welcome
References
TCRProfiler
Statuscodes
XenDB
Download
SBBI
GUUGle
FFGC
AggloIndel
Locomotif
Impressum
ClustalW
pAliKiss
Phase4
libfid
BiBiServ Team
Intronserter
REPuter
InSilicoDicer
acdc
WebService Linklist
TALP
RNAforester
Previous Results
Gecko
pknotsRG
Wotd
MGA
Decomp
BiBiServ policies
AGenDA
References
license
Dialign
PoSSuMsearch