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