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