75 search results - page 9 / 15 » DNA Sequence Compression Using the Burrows-Wheeler Transform |
114
Voted
TCBB
2008
15 years 2 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
138
Voted
BMCBI
2011
14 years 6 months ago
2011
Background: Second generation sequencing technologies yield DNA sequence data at ultra high-throughput. Common to most biological applications is a mapping of the reads to an almo...
132
Voted
TIT
2010
14 years 9 months ago
2010
Abstract--Over the past three decades we have steadily increased our knowledge on the genetic basis of many severe disorders. Nevertheless, there are still great challenges in appl...
136
Voted
BMCBI
2007
15 years 2 months ago
2007
Background: The sequencing of many genomes and tiling arrays consisting of millions of DNA segments spanning entire genomes have made high-resolution copy number analysis possible...
142
Voted
ICIP
2008
IEEE
16 years 4 months ago
2008
IEEE
We consider the problem of reconstructing time sequences of spatially sparse signals (with unknown and time-varying sparsity patterns) from a limited number of linear "incohe...