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