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