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