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