http://www.cnr.it/ontology/cnr/individuo/prodotto/ID7378
Solving haplotyping inference parsimony problem using a new basic polynomial formulation (Articolo in rivista)
- Type
- Label
- Solving haplotyping inference parsimony problem using a new basic polynomial formulation (Articolo in rivista) (literal)
- Anno
- 2008-01-01T00:00:00+01:00 (literal)
- Alternative label
Bertolazzi, P.; Godi, A.; Labbè, M.; Tininini, L. (2008)
Solving haplotyping inference parsimony problem using a new basic polynomial formulation
in Computers & mathematics with applications (1987)
(literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
- Bertolazzi, P.; Godi, A.; Labbè, M.; Tininini, L. (literal)
- Pagina inizio
- Pagina fine
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
- Rivista
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
- doi : 10.1016/j.camwa.2006.12.095 (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
- Note
- Elsevier (literal)
- Mathematical Reviews on the web (MathSciNet) (literal)
- Scopu (literal)
- ISI Web of Science (WOS) (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
- Paola Bertolazzi Istituto di Analisi dei Sistemi e Informatica \"A. Ruberti\" CNR
Alessandra Godi Universita' di Roma Tre
Martine Labbe Universite Libre de Bruxelles
Leonrado Tinini Istituto di Analisi dei Sistemi e Informatica \"A. Ruberti\" CNR (literal)
- Titolo
- Solving haplotyping inference parsimony problem using a new basic polynomial formulation (literal)
- Abstract
- Similarity and diversity among individuals of the same species are expressed in small DNA variations called Single Nucleotide
Polymorphism. The knowledge of SNP phase gives rise to the haplotyping problem that in the parsimonious version states to infer
the minimum number of haplotypes from a given set of genotype data. ILP technique represents a good resolution strategy for this
interesting combinatorial problem whose main limit lies in its NP-hardness. In this paper we present a new polynomial model for
the haplotyping inference by parsimony problem characterized by the original use of a maximum formulation jointly with a good
heuristic solution. This approach showed to be a robust basic model that can be used as starting point for more sophisticated ILP
techniques like branch and cut and polyhedral studies. (literal)
- Prodotto di
- Autore CNR
Incoming links:
- Autore CNR di
- Prodotto
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi