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