Sciweavers

154 search results - page 15 / 31
» A polyhedral approach to sequence alignment problems
Sort
View
FOCS
2006
IEEE
15 years 3 months ago
Minimum Bounded Degree Spanning Trees
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
Michel X. Goemans
RECOMB
2005
Springer
15 years 10 months ago
Consensus Folding of Unaligned RNA Sequences Revisited
As one of the earliest problems in computational biology, RNA secondary structure prediction (sometimes referred to as "RNA folding") problem has attracted attention agai...
Vineet Bafna, Haixu Tang, Shaojie Zhang
BMCBI
2011
14 years 1 months ago
Efficient alignment of pyrosequencing reads for re-sequencing applications
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...
Francisco Fernandes, Paulo G. S. da Fonseca, Lu&ia...
RECOMB
2004
Springer
15 years 10 months ago
Multiple organism gene finding by collapsed gibbs sampling
The Gibbs sampling method has been widely used for sequence analysis after it was successfully applied to the problem of identifying regulatory motif sequences upstream of genes. ...
Sourav Chatterji, Lior Pachter
JCDL
2006
ACM
176views Education» more  JCDL 2006»
15 years 3 months ago
A hierarchical, HMM-based automatic evaluation of OCR accuracy for a digital library of books
A number of projects are creating searchable digital libraries of printed books. These include the Million Book Project, the Google Book project and similar efforts from Yahoo an...
Shaolei Feng, R. Manmatha