Journal of the ACM (JACM)
On the Approximation of Shortest Common Supersequencesand Longest Common Subsequences
SIAM Journal on Computing
On the complexity of comparing evolutionary trees
Discrete Applied Mathematics - Special volume on computational molecular biology
Some APX-completeness results for cubic graphs
Theoretical Computer Science
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The Haplotyping problem: an overview of computational models and solutions
Journal of Computer Science and Technology
Opportunities for Combinatorial Optimization in Computational Biology
INFORMS Journal on Computing
Parameterized Complexity
| Hi-index | 0.00 |
The Longest Haplotype Reconstruction (LHR) problem has been introduced in Computational Biology for the reconstruction of the haplotypes of an individual, starting from a matrix of incomplete haplotype fragments. In this paper, we reconsider the LHR problem, proving that it is NP-hard even in the restricted case when the input matrix is error-free. Then, we investigate the approximation complexity of the problem, showing that it cannot be approximated within factor 2logδ nm for any constant δ poly log nm]. Finally, we give a fixed-parameter algorithm, where the parameter is the size of the reconstructed haplotypes.