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