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