
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Maria Luisa Bonet, Simone Linz, Katherine St. John, "The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 9, no. 1, pp. 273285, January/February, 2012.  
BibTex  x  
@article{ 10.1109/TCBB.2011.108, author = {Maria Luisa Bonet and Simone Linz and Katherine St. John}, title = {The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility}, journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {9}, number = {1}, issn = {15455963}, year = {2012}, pages = {273285}, doi = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2011.108}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE/ACM Transactions on Computational Biology and Bioinformatics TI  The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility IS  1 SN  15455963 SP273 EP285 EPD  273285 A1  Maria Luisa Bonet, A1  Simone Linz, A1  Katherine St. John, PY  2012 KW  ASPcomplete KW  Betweenness KW  Quartet Challenge KW  phylogenetics KW  Quartet Compatibility KW  satisfiability. VL  9 JA  IEEE/ACM Transactions on Computational Biology and Bioinformatics ER   
[1] M.E.J. Amaral, J.R. Grant, P.K. Riggs, N.B. Stafuzza, E.A.R. Filho, T. Goldammer, R. Weikard, R.M. Brunner, K.J. Kochan, A.J. Greco, J. Jeong, Z. Cai, G. Lin, A. Prasad, S. Kumar, G.P. Saradhi, B. Mathew, M.A. Kumar, M.N. Miziara, P. Mariani, A.R. Caetano, S.R. Galvão, M.S. Tantia, R.K. Vijh, B. Mishra, S.B. Kumar, V.A. Pelai, A.M. Santana, L.C. Fornitano, B.C. Jones, H. Tonhati, S. Moore, P. Stothard, and J.E. Womack, “A First Generation Whole Genome RH Map of the River Buffalo with Comparison to Domestic Cattle,” BMC Genomics, vol. 9, article 631, 2008.
[2] A. BenDor, B. Chor, D. Graur, R. Ophir, and D. Pelleg, “From FourTaxon Trees to Phylogenies: The Case of Mammalian Evolution,” Proc. Second Ann. Int'l Conf. Computational Molecular Biology (RECOMB '98), pp. 919, 1998.
[3] V. Berry, T. Jiang, P. Kearney, M. Li, and T. Wareham, “Quartet Cleaning: Improved Algorithms and Simulations,” Proc. Seventh Ann. European Symp. Algorithms (ESA '99), pp. 313324, 1999.
[4] V. Berry and O. Gascuel, “Inferring Evolutionary Trees with Strong Combinatorial Evidence,” Theoretical Computer Science, vol. 240, no. 2, pp. 271298, 2000.
[5] S. Böcker, D. Bryant, A.W.M. Dress, and M. Steel, “Algorithmic Aspects of Tree Amalgamation,” J. Algorithms, vol. 37, pp. 522537, 2000.
[6] D. Bryant and M. Steel, “Extension Operations on Sets of LeafLabelled Trees,” Advances in Applied Math., vol. 16, no. 4, pp. 425453, 1995.
[7] P. Buneman, “A Note on the Metric Properties of Trees,” J. Combinatorial Theory Series B, vol. 17, pp. 4850, 1974.
[8] B. Chor and M. Sudan, “A Geometric Approach to Betweenness,” SIAM J. Discrete Math., vol. 11, no. 4, pp. 511523, 1998.
[9] B.P. Chowdhary, T. Raudsepp, S.R. Kata, G. Goh, L.V. Millon, V. Allan, F. Piumi, G. Guerin, J. Swinburne, M. Binns, T.L. Lear, J. Mickelson, J. Murray, D.F. Antczak, J.E. Womack, and L.C. Skow, “The FirstGeneration WholeGenome Radiation Hybrid Map in the Horse Identifies Conserved Segments in Human and Mouse Genomes,” Genome Research, vol. 13, nos. 742751, 2003.
[10] S.A. Cook, “The Complexity of TheoremProving Procedures,” Proc. the Third Ann. ACM Symp. Theory of Computing, pp. 151158, 1971.
[11] D. Cox, M. Burmeister, E. Price, S. Kim, and R. Myers, “Radiation Hybrid Mapping: A Somatic Cell Genetic Method for Constructing HighResolution Maps of Mammalian Chromosomes,” Science, vol. 250, no. 4978, pp. 245250, 1990.
[12] C. Dowden, “On the Maximum Size of Minimal Definitive Quartet Sets,” Discrete Math., vol. 310, pp. 25462549, 2010.
[13] P. Erdös, M. Steel, L. Székély, and T. Warnow, “A Few Logs Suffice to Build (Almost) All Trees: Part II,” Theoretical Computer Science, vol. 221, pp. 77118, 1999.
[14] L.R. Foulds and R.L. Graham, “The Steiner Problem in Phylogeny Is NPComplete,” Advances in Applied Math., vol. 3, no. 1, pp. 4349, 1982.
[15] M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness. A Series of Books in the Mathematical Sciences. WH Freeman and Company, 1979.
[16] J. Gramm, A. Nickelsen, and T. Tantau, “Fixedparameter Algorithms in Phylogenetics,” The Computer J., vol. 51, pp. 79101, 2007.
[17] S. Grünewald, P. Humphries, and C. Semple, “Quartet Compatibility and the Quartet Graph,” The Electronic J. Combinatorics, vol. 15, no. R103, 2008.
[18] G. Gyapay, K. Schmitt, C. Fizames, H. Jones, N. VegaCzarny, D. Spillett, D. Muselet, J.F. Prud'Homme, C. Dib, C. Auffray, J. Morissette, J. Weissenbach, and P.N. Goodfellow, “A Radiation Hybrid Map of the Human Genome,” Human Molecular Genetics, vol. 5, no. 3, pp. 339346, 1996.
[19] M. Habib and J. Stacho, “Unique Perfect Phylogeny Is NPHard,” Combinatorial Pattern Matching (CPM 2011), LNCS, vol. 6661, pp. 132146, 2011.
[20] D. Huson, S. Nettles, and T. Warnow, “DiskCovering, a FastConverging Method for Phylogenetic Tree Reconstruction,” Computational Biology, vol. 6, pp. 369386, 1999.
[21] T. Jiang, P. Kearney, and M. Li, “Some Open Problems in Computational Molecular Biology,” J. Algorithms, vol. 34, no. 1, pp. 194201, 2000.
[22] L. Juban, “Dichotomy Theorem for the Generalized Unique Satisfiability Problem,” Proc. 12th Int'l Symp. Fundamentals of Computation Theory (FCT '99), pp. 327338, 1999.
[23] J. Opatrny, “Total Ordering Problem,” SIAM J. Computing, vol. 8, no. 1, pp. 111114, 1979.
[24] C. Papadimitriou, Computational Complexity. John Wiley and Sons Ltd., 2003.
[25] S. Roch, “A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood Is Hard,” IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 3, no. 1, pp. 9294, Jan.Mar. 2006.
[26] C. Semple and M. Steel, “A Characterization for a Set of Partial Partitions to Define an Xtree,” Discrete Math., vol. 247, no. 1, pp. 169186, 2002.
[27] C. Semple and M. Steel, Phylogenetics. Oxford Univ. Press, 2003.
[28] M. Steel, “The Complexity of Reconstructing Trees from Qualitative Characters and Subtrees,” J. Classification, vol. 9, pp. 91116, 1992.
[29] M. Steel, http://www.math.canterbury.ac.nz/~m.steel challen ges.shtml#Hundred, 2011.
[30] G. Wu, J. You, and G. Lin, “A Lookahead BranchandBound Algorithm for the Maximum Quartet Consistency Problem,” Proc. Workshop Algorithms in Bioinformatics (WABI '05), pp. 6576, 2005.
[31] T. Yato and T. Seta, “Complexity and Completeness of Finding Another Solution and Its Application to Puzzles,” IEICE Trans. Fundamentals of Electronics, Comm. and Computer Sciences, vol. E86A, no. 5, pp. 10521060, 2003.