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