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