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