A linear time approximation scheme for maximum quartet consistency on sparse sampled inputs

SIAM Journal on Discrete Mathematics

Volumn 25, Issue 4, 2011, Pages 1722-1736

  Snir, Sagi ^a   Yuster, Raphael ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

Approximation scheme; Phylogenetic reconstruction; Quartet amalgamation

Indexed keywords

APPROXIMATION SCHEME; BEST APPROXIMATIONS; BIOLOGICAL PROBLEMS; COMBINATORIAL TECHNIQUES; HIGH PROBABILITY; LINEAR TIME; LINEAR-TIME APPROXIMATION; MAXIMUM QUARTET CONSISTENCIES; NP-HARD; PHYLOGENETIC RECONSTRUCTION; PHYLOGENETIC TREES; POLYNOMIAL TIME APPROXIMATION SCHEMES; POLYNOMIAL-TIME; QUARTET AMALGAMATION; RANDOMIZED APPROXIMATION SCHEMES;

BIOLOGY; FORESTRY; HIGH ENERGY PHYSICS; METALS; POLYNOMIAL APPROXIMATION;

TREES (MATHEMATICS);

ALGORITHMS; FORESTRY; PROBABILITY; PROBLEM SOLVING;

EID: 84855655269     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/110820555     Document Type: Article

References (19)

1. A. V. Aho, Y. Sagiv, T. G. Szymanski, and J. D. Ullman, Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions, SIAM J. Comput., 10 (1981), pp. 405-421.
2. N. Alon and J. Spencer, The Probabilistic Method, 2nd ed., John Wiley, New York, 2000.
3. V. Berry and O. Gascuel, Inferring evolutionary trees with strong combinatorial evidence, Theoret. Comput. Sci., 240 (2001), pp. 271-298.
4. V. Berry, T. Jiang, P. Kearney, M. Li, and T. Wareham, Quartet cleaning: Improved algorithms and simulations, in Proceedings of the Seventh Annual European Symposium on Algorithms, 1999, pp. 313-324.
5. G. Della Vedova, T. Jiang, J. Li, and J. Wen, Approximating minimum quartet inconsistency, in Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, 2002, ACM/SIAM, pp. 894-895.
6. G. Della Vedova and T. Wareham, Optimal algorithms for local vertex quartet cleaning, Bioinformatics, 18 (2002), pp. 1297-1304. (Pubitemid 35244186)
7. I. Giotis and V. Guruswami, Correlation clustering with a fixed number of clusters, Theory Comput., 2 (2006), pp. 249-266.
8. M. Henzinger, V. King, and T. Warnow, Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology, in Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Atlanta, 1996, ACM/SIAM, pp. 333-340.
9. T. Jiang, P. Kearney, and M. Li, A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application, SIAM J. Comput., 30 (2001), pp. 1942-1961. (Pubitemid 34125443)
10. U. Roshan, B. Moret, T. Williams, and T. Warnow, Rec-i-dcm3: A fast algorithmic technique for reconstructing large phylogenetic tree, in Proceedings of the Third International IEEE Computational Systems Bioinformatics conference (CSB), 2004, pp. 98-109. (Pubitemid 40276243)
11. C. Semple and M. Steel, Phylogenetics, Oxford University Press, Oxford, UK, 2003.
12. S. Snir and S. Rao, Quartets maxcut: A divide and conquer quartets algorithm, IEEE/ACM Trans. Comput. Biol. Bioinform., 7 (2010), pp. 704-718.
13. S. Snir and R. Yuster, Reconstructing approximate phylogenetic trees from quartet samples, in Proceedings of the 21st ACM-SIAM Symposium on Discrete Algorithms (SODA), Austin, 2010, ACM/SIAM, pp. 1035-1044.
14. M. Steel, The complexity of reconstructing trees from qualitative characters and subtress, J. Classification, 9 (1992), pp. 91-116.
15. K. Strimmer and A. von Haeseler, Quartet puzzling: A quartet maximum-likelihood method for reconstructing tree topologies, Molecular Biol. Evolution, 13 (1996), pp. 964-969. (Pubitemid 26284912)
16. M. Swenson, R. Suri, C. Linder, and T. Warnow, An experimental study of quartets maxcut and other supertree methods, in Workshop on Algorithms in Bioinformatics, V. Moulton and M. Singh, eds., Lecture Notes in Comput. Sci. 6293, Springer, Berlin, 2010, pp. 288-299.
17. V. Vazirani, Approximation Algorithms, Springer, Berlin, 2004.
18. G. Wu, M. Kao, G. Lin, and J. You, Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability, Algorithms Molec. Biol., 3 (2008).
19. G. Wu, J. You, and G. Lin, A polynomial time algorithm for the minimum quartet inconsistency problem with o(n) quartet errors, Inform. Process. Lett., 100 (2006), pp. 167-171.