Abstract
We study the parameterized complexity of the problem to reconstruct a binary (evolutionary) tree from a complete set of quartet topologies in the case of a limited number of errors. More precisely, we are given n taxa, exactly one topology for every subset of 4 taxa, and a positive integer k (the parameter). Then, the Minimum Quartet In- consistency (MQI) problem is the question of whether we can find an evolutionary tree inducing a set of quartet topologies that differs from the given set in only k quartet topologies. MQI is NP-complete. However, we can compute the required tree in worst case time O(4k. n + n4)— the problem is fixed parameter tractable. Our experimental results show that in practice, also based on heuristic improvements proposed by us, even a much smaller exponential growth can be achieved. We extend the fixed parameter tractability result to weighted versions of the problem. In particular, our algorithm can produce all solutions that resolve at most k errors.
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
J. Alber, J. Gramm, and R. Niedermeier. Faster exact solutions for hard problems: a parameterized point of view. Discrete Mathematics, 229(1-3):3–27, 2001.
H.-J. Bandelt and A. Dress. Reconstructing the shape of a tree from observed dissimilarity data. Advances in Applied Mathematics, 7:309–343, 1986.
A. Ben-Dor, B. Chor, D. Graur, R. Ophir, and D. Pelleg. Constructing phylogenies from quartets: elucidation of eutherian superordinal relationships. Journal of Computational Biology, 5:377–390, 1998.
V. Berry and O. Gascuel. Inferring evolutionary trees with strong combinatorial evidence. Theoretical Computer Science, 240:271–298, 2000. Software available through http://www.lirmm.fr/~vberry/PHYLOQUART/phyloquart.html.
P. Buneman. The recovery of trees from measures of dissimilarity. In Hodson et al., eds, Anglo-Romanian Conference on Mathematics in the Archaeological and Historical Sciences, pages 387–395, 1971. Edinburgh University Press.
B. Chor. From quartets to phylogenetic trees. In Proceedings of the 25th SOFSEM, number 1521 in LNCS, pages 36–53, 1998. Springer.
R.G. Downey and M.R. Fellows. Parameterized Complexity. 1999. Springer.
M.R. Fellows. Parameterized complexity: new developments and research frontiers. In Downey and Hirschfeldt, eds, Aspects of Complexity, to appear, 2001. De Gruyter.
J. Felsenstein. PHYLIP (Phylogeny Inference Package) version 3.5c. Distributed by the author. Department of Genetics, University of Washington, Seattle. 1993. Available through http://evolution.genetics.washington.edu/phylip.
J. Gramm and R. Niedermeier. Minimum Quartet Inconsistency is fixed parameter tractable. Technical Report WSI-2001-3, WSI für Informatik, Universität Tübingen, Fed. Rep. of Germany, January 2001. Report available through http://www-fs.informatik.uni-tuebingen.de/~gramm/publications.
T. Jiang, P. Kearney, and M. Li. Some open problems in computational molecular biology. Journal of Algorithms, 34:194–201, 2000.
T. Jiang, P. Kearney, and M. Li. A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application. To appear in SIAM Journal on Computing, 2001.
R. Niedermeier and P. Rossmanith. An efficient fixed parameter algorithm for 3-Hitting Set. Technical Report WSI-99-18, WSI für Informatik, Universität Tübingen, October 1999. To appear in Journal of Discrete Algorithms.
R. Niedermeier and P. Rossmanith. On efficient fixed parameter algorithms for Weighted Vertex Cover. In Proceedings of the 11th International Symposium on Algorithms and Computation, number 1969 in LNCS, pages 180–191, 2000. Springer.
K. St. John, T. Warnow, B.M.E. Moret, and L. Vawter. Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, pages 196–205, 2001. SIAM Press.
M. Steel. The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification, 9:91–116, 1992.
K. Strimmer and A. von Haeseler. Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies. Molecular Biology and Evolution, 13(7):964–969, 1996.
M. Weiß, Z. Yang, and F. Oberwinkler. Molecular phylogenetic studies in the genus Amanita. Canadian Journal of Botany, 76:1170–1179, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gramm, J., Niedermeier, R. (2001). Minimum Quartet Inconsistency Is Fixed Parameter Tractable. In: Amir, A. (eds) Combinatorial Pattern Matching. CPM 2001. Lecture Notes in Computer Science, vol 2089. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48194-X_23
Download citation
DOI: https://doi.org/10.1007/3-540-48194-X_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42271-6
Online ISBN: 978-3-540-48194-2
eBook Packages: Springer Book Archive