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