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