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