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