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