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