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