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