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