Counting Trees in a Phylogenetic Network Is \#P-Complete
暂无分享,去创建一个
[1] J. Hein. Reconstructing evolution of sequences subject to recombination using parsimony. , 1990, Mathematical biosciences.
[2] Daniel H. Huson,et al. Phylogenetic Networks: Contents , 2010 .
[3] Stephen J. Willson,et al. Properties of Normal Phylogenetic Networks , 2010, Bulletin of mathematical biology.
[4] Salil P. Vadhan,et al. The Complexity of Counting in Sparse, Regular, and Planar Graphs , 2002, SIAM J. Comput..
[5] Daniel H. Huson,et al. Phylogenetic Networks - Concepts, Algorithms and Applications , 2011 .
[6] Leo van Iersel,et al. Locating a tree in a phylogenetic network , 2010, Inf. Process. Lett..
[7] Wing-Kin Sung,et al. Reconstructing Recombination Network from Sequence Data: The Small Parsimony Problem , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[8] Eric Bapteste,et al. INAUGURAL ARTICLE by a Recently Elected Academy Member:Pattern pluralism and the Tree of Life hypothesis , 2007 .
[9] D. Huson,et al. Application of phylogenetic networks in evolutionary studies. , 2006, Molecular biology and evolution.
[10] Fred S. Roberts,et al. Applied Combinatorics , 1984 .
[11] John M. Mellor-Crummey,et al. Reconstructing phylogenetic networks using maximum parsimony , 2005, 2005 IEEE Computational Systems Bioinformatics Conference (CSB'05).
[12] Ge Xia,et al. Seeing the trees and their branches in the network is hard , 2007, Theor. Comput. Sci..
[13] Michael Luby,et al. Approximating the Permanent of Graphs with Large Factors , 1992, Theor. Comput. Sci..
[14] Lavanya Kannan,et al. Maximum Parsimony on Phylogenetic networks , 2012, Algorithms for Molecular Biology.
[15] Gabriel Cardona,et al. Comparison of Tree-Child Phylogenetic Networks , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[16] Sagi Snir,et al. Parsimony Score of Phylogenetic Networks: Hardness Results and a Linear-Time Heuristic , 2009, IEEE/ACM Transactions on Computational Biology and Bioinformatics.