Article

Unique perfect phylogeny is NP-hard

Authors:

Juraj StachoAuthors Info & Claims

CPM'11: Proceedings of the 22nd annual conference on Combinatorial pattern matching

Pages 132 - 146

Published: 27 June 2011 Publication History

Abstract

We answer, in the affirmative, the following question proposed by Mike Steel as a $100 challenge: "Is the following problem NP-hard? Given a ternary phylogenetic X-tree T and a collection Q of quartet subtrees on X, is T the only tree that displays Q?" [28, 29] As a particular consequence of this, we show that the unique chordal sandwich problem is also NP-hard.

References

[1]

Agarwala, R., Fernández-Baca, D.: A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed. SIAM Journal of Computing 23, 1216-1224 (1994).

Digital Library

[2]

Böcker, S., Bryant, D., Dress, A.W.M., Steel, M.A.: Algorithmic aspects of tree amalgamation. Journal of Algorithms 37, 522-537 (2000).

Digital Library

[3]

Bodlaender, H.L., Fellows, M.R., Warnow, T.J.: Two strikes against perfect phylogeny. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 273-283. Springer, Heidelberg (1992).

Digital Library

[4]

Bonet, M.L., Linz, S., John, K.S.: The complexity of finding multiple solutions to betweenness and quartet compatibility. CoRR abs/1101.2170 (2011), http://arxiv.org/abs/1101.2170

[5]

Bui-Xuan, B.M., Habib, M., Paul, C.: Competitive graph searches. Journal Theoretical Computer Science 393, 72-80 (2008).

Digital Library

[6]

Buneman, P.: A characterization of rigid circuit graphs. Discrete Mathematics 9, 205-212 (1974).

Digital Library

[7]

Camin, J., Sokal, R.: A method for deducing branching sequences in phylogeny. Evolution 19, 311-326 (1965).

[8]

Creignou, N., Hermann, M.: Complexity of generalized satisfiability counting problems. Information and Computation 125, 1-12 (1996).

Digital Library

[9]

Dekker, M.C.H.: Reconstruction methods for derivation trees. Master's thesis, Vrije Universiteit, Amsterdam (1986).

[10]

Estabrook, G.F.: Cladistic methodology: a discussion of the theoretical basis for the induction of evolutionary history. Annual Review of Ecology and Systematics 3, 427-456 (1972).

[11]

Estabrook, G.F., Johnson Jr., C.S., McMorris, F.R.: An idealized concept of the true cladistic character. Mathematical Biosciences 23, 263-272 (1975).

[12]

Estabrook, G.F., Johnson Jr., C.S., McMorris, F.R.: An algebraic analysis of cladistic characters. Discrete Mathematics 16, 141-147 (1976).

[13]

Estabrook, G.F., Johnson Jr., C.S., McMorris, F.R.: A mathematical foundation for the analysis of cladistic character compatibility. Mathematical Biosciences 29, 181-187 (1976).

[14]

Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd edn. North Holland (2004).

Digital Library

[15]

Golumbic, M.C., Kaplan, H., Shamir, R.: Graph sandwich problems. Journal of Algorithms 19, 449-473 (1995).

Digital Library

[16]

Golumbic, M.C., Shamir, R.: Complexity and algorithms for reasoning about time: a graph-theoretic approach. Journal of the ACM 40, 1108-1133 (1993).

Digital Library

[17]

Gordon, A.D.: Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves. Journal of Classification 3, 335-348 (1986).

[18]

Gusfield, D.: Efficient algorithms for inferring evolutionary trees. Networks 21, 19-28 (1991).

[19]

Habib, M., Stacho, J.: Unique perfect phylogeny is NP-hard. CoRR abs/1011.5737 (2010), http://arxiv.org/abs/1011.5737

[20]

Juban, L.: Dichotomy theorem for the generalized unique satisfiability problem. In: Ciobanu, G., Paun, G. (eds.) FCT 1999. LNCS, vol. 1684, pp. 327-337. Springer, Heidelberg (1999).

Digital Library

[21]

Kannan, S.K., Warnow, T.J.: Triangulating 3-colored graphs. SIAM Journal on Discrete Mathematics 5, 249-258 (1992).

Digital Library

[22]

Lam, F., Gusfield, D., Sridhar, S.: Generalizing the four gamete condition and splits equivalence theorem: Perfect phylogeny on three state characters. In: Salzberg, S.L., Warnow, T. (eds.) WABI 2009. LNCS, vol. 5724, pp. 206-219. Springer, Heidelberg (2009).

Digital Library

[23]

LeQuesne, W.J.: Further studies on the uniquely derived character concept. Systematic Zoology 21, 281-288 (1972).

[24]

LeQuesne, W.J.: The uniquely evolved character concept and its cladistic application. Systematic Zoology 23, 513-517 (1974).

[25]

LeQuesne, W.J.: The uniquely evolved character concept. Systematic Zoology 26, 218-223 (1977).

[26]

McMorris, F.R., Warnow, T., Wimer, T.: Triangulating vertex colored graphs. SIAM Journal on Discrete Mathematics 7, 296-306 (1994).

Digital Library

[27]

Semple, C., Steel, M.: A characterization for a set of partial partitions to define an X-tree. Discrete Mathematics 247, 169-186 (2002).

Digital Library

[28]

Semple, C., Steel, M.: Phylogenetics. Oxford lecture series in mathematics and its applications. Oxford University Press, Oxford (2003).

[29]

Steel, M.: Personal webpage, http://www.math.canterbury.ac.nz/~m.steel/

[30]

Steel, M.: The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification 9, 91-116 (1992).

[31]

West, D.: Introduction to Graph Theory. Prentice-Hall, Englewood Cliffs (1996).

[32]

Wilson, E.O.: A consistency test for phylogenies based upon contemporaneous species. Systematic Zoology 14, 214-220 (1965).

Cited By

Macedonio DMerro M(2014)A semantic analysis of key management protocols for wireless sensor networksScience of Computer Programming10.1016/j.scico.2013.01.00581(53-78)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1016/j.scico.2013.01.005
Habib MStacho J(2013)Unique perfect phylogeny is intractableTheoretical Computer Science10.1016/j.tcs.2012.12.048476(47-66)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1016/j.tcs.2012.12.048
Amparore EDonatelli S(2013)A component-based solution for reducible Markov regenerative processesPerformance Evaluation10.1016/j.peva.2013.02.00270:6(400-422)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.1016/j.peva.2013.02.002
Show More Cited By

Unique perfect phylogeny is NP-hard
1. Mathematics of computing
  1. Discrete mathematics

Recommendations

Unique perfect phylogeny is intractable

A phylogeny is a tree capturing evolution and ancestral relationships of a set of taxa (e.g., species). Reconstructing phylogenies from molecular data plays an important role in many areas of contemporary biological research. A phylogeny is perfect if (...
Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion
Sixth Twente Workshop on Graphs and Combinatorial Optimization

A number of results in hamiltonian graph theory are of the form "P₁ implies P₂", where P₁ is a property of graphs that is NP-hard and P₂ is a cycle structure property of graphs that is also NP-hard. An example of such a theorem is the well-known Chvátal-...
Clique-width minimization is NP-hard
STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing

Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard graph problems (e.g., problems expressible in Monadic Second Order Logic with second-order quantification on vertex sets, that includes NP-hard problems) ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

CPM'11: Proceedings of the 22nd annual conference on Combinatorial pattern matching

June 2011

480 pages

ISBN:9783642214578

Editors:
Raffaele Giancarlo
University of Palermo, Department of Mathematics, Palermo, Italy
,
Giovanni Manzini
University of 'Piemonte Orientale', Department of Computer Science, Alessandria, Italy

Sponsors

Palermo University: Palermo University
UNIPMN: University of Piemonte Orientale

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 27 June 2011

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 02 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Macedonio DMerro M(2014)A semantic analysis of key management protocols for wireless sensor networksScience of Computer Programming10.1016/j.scico.2013.01.00581(53-78)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1016/j.scico.2013.01.005
Habib MStacho J(2013)Unique perfect phylogeny is intractableTheoretical Computer Science10.1016/j.tcs.2012.12.048476(47-66)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1016/j.tcs.2012.12.048
Amparore EDonatelli S(2013)A component-based solution for reducible Markov regenerative processesPerformance Evaluation10.1016/j.peva.2013.02.00270:6(400-422)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.1016/j.peva.2013.02.002
Corona IGiacinto GRoli F(2013)Adversarial attacks against intrusion detection systemsInformation Sciences: an International Journal10.1016/j.ins.2013.03.022239(201-225)Online publication date: 1-Aug-2013
https://dl.acm.org/doi/10.1016/j.ins.2013.03.022
Husseinzadeh Kashan AHusseinzadeh Kashan MKarimiyan S(2013)A particle swarm optimizer for grouping problemsInformation Sciences: an International Journal10.1016/j.ins.2012.10.036252(81-95)Online publication date: 1-Dec-2013
https://dl.acm.org/doi/10.1016/j.ins.2012.10.036
Meseguer JRoşu G(2013)The rewriting logic semantics projectInformation and Computation10.1016/j.ic.2013.08.004231(38-69)Online publication date: 1-Oct-2013
https://dl.acm.org/doi/10.1016/j.ic.2013.08.004
Masegosa AMoral S(2013)New skeleton-based approaches for Bayesian structure learning of Bayesian networksApplied Soft Computing10.1016/j.asoc.2012.09.02913:2(1110-1120)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1016/j.asoc.2012.09.029
Bonet MLinz SSt. John K(2012)The Complexity of Finding Multiple Solutions to Betweenness and Quartet CompatibilityIEEE/ACM Transactions on Computational Biology and Bioinformatics10.1109/TCBB.2011.1089:1(273-285)Online publication date: 1-Jan-2012
https://dl.acm.org/doi/10.1109/TCBB.2011.108
Träff J(2012)Alternative, uniformly expressive and more scalable interfaces for collective communication in MPIParallel Computing10.1016/j.parco.2011.10.00938:1-2(26-36)Online publication date: 1-Jan-2012
https://dl.acm.org/doi/10.1016/j.parco.2011.10.009
Mitra SKundu PPedrycz W(2012)Feature selection using structural similarityInformation Sciences: an International Journal10.1016/j.ins.2012.02.042198(48-61)Online publication date: 1-Sep-2012
https://dl.acm.org/doi/10.1016/j.ins.2012.02.042
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten