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