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