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