CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2008 vol.5 Issue No.02 - April-June

Subscribe

Issue No.02 - April-June (2008 vol.5)

pp: 301-312

ABSTRACT

The problem Parsimony Haplotyping (PH) asks for the smallest set of haplotypes which can explain a given set of genotypes, and the problem Minimum Perfect Phylogeny Haplotyping (MPPH) asks for the smallest such set which also allows the haplotypes to be embedded in a perfect phylogeny, an evolutionary tree with biologically-motivated restrictions. For PH, we extend recent work by further mapping the interface between ``easy'' and ``hard'' instances, within the framework of (k,l)-bounded instances where the number of 2's per column and row of the input matrix is restricted. By exploring, in the same way, the tractability frontier of MPPH we provide the first concrete, positive results for this problem. In addition, we construct for both PH and MPPH polynomial time approximation algorithms, based on properties of the columns of the input matrix.

INDEX TERMS

Biology and genetics, Combinatorial algorithms, Complexity hierarchies

CITATION

Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, "Shorelines of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems",

*IEEE/ACM Transactions on Computational Biology and Bioinformatics*, vol.5, no. 2, pp. 301-312, April-June 2008, doi:10.1109/TCBB.2007.70232REFERENCES

- [1] P. Alimonti and V. Kann, “Hardness of Approximating Problems on Cubic Graphs,”
Proc. Third Italian Conf. Algorithms and Complexity, pp. 288-298, 1997.- [3] J.R.S. Blair and B. Peyton, “An Introduction to Chordal Graphs and Clique Trees,”
Graph Theory and Sparse Matrix Computation. pp. 1-29, Springer, 1993.- [4] P. Bonizzoni, G.D. Vedova, R. Dondi, and J. Li, “The Haplotyping Problem: An Overview of Computational Models and Solutions,”
J. Computer Science and Technology, vol. 18, no. 6, pp. 675-688, 2003.- [6] R. Cilibrasi, L.J.J. van Iersel, S.M. Kelk, and J. Tromp, “On the Complexity of Several Haplotyping Problems,”
Proc. Fifth Int'l Workshop Algorithms in Bioinformatics (WABI '05), pp. 128-139, 2005.- [8] D. Gusfield,
Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge Univ. Press, 1997.- [10] D. Gusfield, “Haplotype Inference by Pure Parsimony,”
Proc. 14th Ann. Symp. Combinatorial Pattern Matching, pp. 144-155, 2003.- [11] B.V. Halldórsson, V. Bafna, N. Edwards, R. Lippert, S. Yooseph, and S. Istrail, “A Survey of Computational Methods for Determining Haplotypes,”
Proc. DIMACS/RECOMB Satellite Workshop: Computational Methods for SNPs and Haplotype Inference, pp.26-47, 2004.- [12] L.J.J. van Iersel, J.C.M. Keijsper, S.M. Kelk, and L. Stougie, “Beaches of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems,”
Proc. Sixth Int'l Workshop Algorithms in Bioinformatics (WABI '06), pp. 80-91, 2006.- [13] L.J.J. van Iersel, J.C.M. Keijsper, S.M. Kelk, and L. Stougie, “Shorelines of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems,” technical report, http://www.win.tue.nl/bs/spor2007-03.pdf , 2007.
- [17] D.J. Rose, R.E. Tarjan, and G.S. Lueker, “Algorithmic Aspects of Vertex Elimination on Graphs,”
SIAM J. Computing, vol. 5, pp. 266-283, 1976.- [19] Y.S. Song, Y. Wu, and D. Gusfield, “Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with Single Haploplasy or Recombination Event,”
Proc. Fifth Int'l Workshop Algorithms in Bioinformatics (WABI '05), pp. 152-164, 2005. |