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