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