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