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