82 search results - page 9 / 17 » A genome alignment algorithm based on compression |
RECOMB
2005
Springer
15 years 9 months ago
2005
Springer
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
102
click to vote
BMCBI
2011
14 years 1 months ago
2011
Background: Over the past few years, new massively parallel DNA sequencing technologies have emerged. These platforms generate massive amounts of data per run, greatly reducing th...
106
click to vote
BMCBI
2011
14 years 3 months ago
2011
Background: The prediction of the structure of large RNAs remains a particular challenge in bioinformatics, due to the computational complexity and low levels of accuracy of state...
CIBCB
2007
IEEE
15 years 3 months ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...
RECOMB
1997
Springer
15 years 1 months ago
1997
Springer
Algorithm development for comparing and aligning biological sequences has, until recently, been based on the SI model of mutational events which assumes that modi cation of sequen...