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