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