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