Abstract
We consider the problem of finding a Steiner minimum tree in a hypercube. Specifically, given n terminal vertices in an m dimensional cube and a parameter q, we compute the Steiner minimum tree in time O(72q + 8q nm 2), under the assumption that the length of the minimum Steiner tree is at most m + q.
This problem has extensive applications in taxonomy and biology. The Steiner tree problem in hypercubes is equivalent to the phylogeny (evolutionary tree) reconstruction problem under the maximum parsimony criterion, when each taxon is defined over binary states. The taxa, character set and mutation of a phylogeny correspond to terminal vertices, dimensions and traversal of a dimension in a Steiner tree. Phylogenetic trees that mutate each character exactly once are called perfect phylogenies and their size is bounded by the number of characters. When a perfect phylogeny consistent with the data set exists it can be constructed in linear time. However, real data sets often do not admit perfect phylogenies. In this paper, we consider the problem of reconstructing near-perfect phylogenetic trees (referred to as BNPP). A near-perfect phylogeny relaxes the perfect phylogeny assumption by allowing at most q additional mutations. We show for the first time that the BNPP problem is fixed parameter tractable (FPT) and significantly improve the previous asymptotic bounds.
Supported in part by NSF grant CCF-043075 and ITR grant CCR-0122581(The ALADDIN project).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwala, R., Fernandez-Baca, D.: A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed. SIAM Journal on Computing 23 (1994)
Bodlaender, H., Fellows, M., Warnow, T.: Two Strikes Against Perfect Phylogeny. In: proc. International Colloquium on Automata, Languages and Programming (1992)
Bodlaender, H., Fellows, M., Hallett, M., Wareham, H., Warnow, T.: The Hardness of Perfect Phylogeny, Feasible Register Assignment and Other Problems on Thin Colored Graphs. In: Theoretical Computer Science (2000)
Bonet, M., Steel, M., Warnow, T., Yooseph, S.: Better Methods for Solving Parsimony and Compatibility. Journal of Computational Biology 5(3) (1992)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science (1999)
Day, W.H., Sankoff, D.: Computational Complexity of Inferring Phylogenies by Compatibility. Systematic Zoology (1986)
Damaschke, P.: Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction. In: proc. International Workshop on Parameterized and Exact Computation (2004)
Eskin, E., Halperin, E., Karp, R.M.: Efficient Reconstruction of Haplotype Structure via Perfect Phylogeny. Journal of Bioinformatics and Computational Biology (2003)
Fernandez-Baca, D., Lagergren, J.: A Polynomial-Time Algorithm for Near-Perfect Phylogeny. SIAM Journal on Computing 32 (2003)
Foulds, L.R., Graham, R.L.: The Steiner problem in Phylogeny is NP-complete. Advances in Applied Mathematics (3) (1982)
Ganapathy, G., Ramachandran, V., Warnow, T.: Better Hill-Climbing Searches for Parsimony. In: Workshop on Algorithms in Bioinformatics (2003)
Gusfield, D.: Efficient Algorithms for Inferring Evolutionary Trees. Networks 21 (1991)
Gusfield, D.: Algorithms on Strings, Trees and Sequences. Cambridge University Press, Cambridge (1999)
Gusfield, D., Bansal, V.: A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters. In: proc. Research in Computational Molecular Biology (2005)
Gusfield, D., Eddhu, S., Langley, C.: Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination. In: Proc. IEEE Computer Society Bioinformatics Conference (2003)
Hinds, D.A., Stuve, L.L., Nilsen, G.B., Halperin, E., Eskin, E., Ballinger, D.G., Frazer, K.A., Cox, D.R.: Whole Genome Patterns of Common DNA Variation in Three Human Populations. In: Science (2005), http://www.perlegen.com
The International HapMap Consortium. The International HapMap Project. Nature 426 (2003)
Kannan, S., Warnow, T.: A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies. SIAM Journal on Computing 26 (1997)
Promel, H.J., Steger, A.: The Steiner Tree Problem: A Tour Through Graphs Algorithms and Complexity. Vieweg Verlag (2002)
Sridhar, S., Dhamdhere, K., Blelloch, G.E., Halperin, E., Ravi, R., Schwartz, R.: Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees. In: proc. International Workshop on Bioinformatics Research and Applications (2006)
Semple, C., Steel, M.: Phylogenetics. Oxford University Press, Oxford (2003)
Steel, M.A.: The Complexity of Reconstructing Trees from Qualitative Characters and Subtrees. J. Classification 9 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blelloch, G.E., Dhamdhere, K., Halperin, E., Ravi, R., Schwartz, R., Sridhar, S. (2006). Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11786986_58
Download citation
DOI: https://doi.org/10.1007/11786986_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35904-3
Online ISBN: 978-3-540-35905-0
eBook Packages: Computer ScienceComputer Science (R0)