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)
Locomotif
RNAsifter
Trace2PS
BPR
InSilicoDicer
GUUGle
privacy policy
ClustalW
aCMs
pAliKiss
XenDB
MoRAine
newdist
RNAhybrid
TALP
Decomp
jPREdictor
PREdictor
WebService Linklist
Bellman's GAP Cafe
planACstar
JAli
MGA
Download
AIM
Wotd
license
mmfind
Previous Results
Welcome
SADR
AltAVist
RNAforester
Dialign
BiBiServ Team
BiBiServ policies
SBBI
OMA
AGT-SDP
Wotd
genefisher2
GraphTeams
Intronserter
SciBrow
DCJ
Roci
References
Statuscodes
pknotsRG
RNAshapes
AGenDA
CEGeD
CG-CAT
Impressum
REPuter
Metrans
SWIFT Suit
TCRProfiler
RNAalishapes
FFGC
KnotInFrame
Gecko
Wotd
Rose
acdc
References
paRNAss
E2G
pKiss
ADP
Phase4
ConCysFind
libfid
AggloIndel
ROCOCO
Welcome
PoSSuMsearch2
Unwords
Fly_Pres
Download
Welcome
RapidShapes
GEvolutionS
mkESA
PoSSuMsearch
SplitsTree
dca