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