84 search results - page 15 / 17 » On the Approximability of Comparing Genomes with Duplicates |
FCCM
2011
IEEE
12 years 11 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
RECOMB
2001
Springer
14 years 7 months ago
2001
Springer
Hidden Markov models (HMMs) have been successfully applied to a variety of problems in molecular biology, ranging from alignment problems to gene nding and annotation. Alignment p...
JCSS
2008
13 years 7 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
BMCBI
2005
13 years 7 months ago
2005
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
IJIT
2004
13 years 9 months ago
2004
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....