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