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