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