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