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