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