New results for the Longest Haplotype Reconstruction problem
Uložené v:
| Názov: | New results for the Longest Haplotype Reconstruction problem |
|---|---|
| Autori: | DONDI, Riccardo |
| Zdroj: | Discrete Applied Mathematics. 160:1299-1310 |
| Informácie o vydavateľovi: | Elsevier BV, 2012. |
| Rok vydania: | 2012 |
| Predmety: | Applied Mathematics, 0211 other engineering and technologies, Discrete Mathematics and Combinatorics, Computational biology, Haplotyping, Approximation complexity, Fixed-parameter algorithms, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences |
| Popis: | The haplotyping problem has emerged in recent years as one of the most relevant problems in Computational Biology. In particular, in the Single Individual Haplotyping (SIH) problem, starting from a matrix of incomplete haplotype fragments, the goal is the reconstruction of the two complete haplotypes of an individual. In this paper we consider one of the variants of the Single Individual Haplotyping problem, the Longest Haplotyping Reconstruction (LHR) problem. We prove that the LHR problem is NP-hard even in the restricted case when the input matrix is error-free. Furthermore, we investigate the approximation complexity of the problem, and we show that the problem cannot be approximated within factor 2^l^o^g^^^@d^n^m for any constant @d |
| Druh dokumentu: | Article |
| Jazyk: | English |
| ISSN: | 0166-218X |
| DOI: | 10.1016/j.dam.2011.10.014 |
| Prístupová URL adresa: | https://aisberg.unibg.it/handle/10446/27158 http://dblp.uni-trier.de/db/journals/dam/dam160.html#Dondi12 https://dblp.uni-trier.de/db/journals/dam/dam160.html#Dondi12 https://www.sciencedirect.com/science/article/pii/S0166218X11003891 https://www.sciencedirect.com/science/article/abs/pii/S0166218X11003891 https://hdl.handle.net/10446/27158 http://www.journals.elsevier.com/discrete-applied-mathematics https://doi.org/10.1016/j.dam.2011.10.014 |
| Rights: | Elsevier Non-Commercial |
| Prístupové číslo: | edsair.doi.dedup.....e46db55d73f2ac3970ece9f13a143c4b |
| Databáza: | OpenAIRE |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstrakt: | The haplotyping problem has emerged in recent years as one of the most relevant problems in Computational Biology. In particular, in the Single Individual Haplotyping (SIH) problem, starting from a matrix of incomplete haplotype fragments, the goal is the reconstruction of the two complete haplotypes of an individual. In this paper we consider one of the variants of the Single Individual Haplotyping problem, the Longest Haplotyping Reconstruction (LHR) problem. We prove that the LHR problem is NP-hard even in the restricted case when the input matrix is error-free. Furthermore, we investigate the approximation complexity of the problem, and we show that the problem cannot be approximated within factor 2^l^o^g^^^@d^n^m for any constant @d |
|---|---|
| ISSN: | 0166218X |
| DOI: | 10.1016/j.dam.2011.10.014 |