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