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