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