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