{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:36:26Z","timestamp":1787499386144,"version":"build-2736575974"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T00:00:00Z","timestamp":1364774400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1186\/1748-7188-8-11","type":"journal-article","created":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T14:14:06Z","timestamp":1364825646000},"source":"Crossref","is-referenced-by-count":4,"title":["Incompatible quartets, triplets, and characters"],"prefix":"10.1186","volume":"8","author":[{"given":"Brad","family":"Shutters","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sudheer","family":"Vakati","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Fern\u00e1ndez-Baca","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,4,1]]},"reference":[{"key":"186_CR1","volume-title":"Phylogenetics. Oxford Lecture Series in Mathematics and its Applications","author":"C Semple","year":"2003","unstructured":"Semple C, Steel M: Phylogenetics. Oxford Lecture Series in Mathematics and its Applications. USA: Oxford University Press 2003."},{"key":"186_CR2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/3-540-55719-9_80","volume-title":"Automata, Languages and Programming, Volume 623 of Lecture Notes in Computer Science","author":"H Bodlaender","year":"1992","unstructured":"Bodlaender H, Fellows M, Warnow T: Two strikes against perfect phylogeny. Automata, Languages and Programming, Volume 623 of Lecture Notes in Computer Science. Edited by: Kuich W. Berlin\/Heidelberg: Springer 1992, 273-283."},{"key":"186_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02618470","volume":"9","author":"M Steel","year":"1992","unstructured":"Steel M: The complexity of reconstructing trees from qualitative characters and subtrees. J Classif. 1992, 9: 91-116. 10.1007\/BF02618470.","journal-title":"J Classif"},{"issue":"6","key":"186_CR4","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1137\/S0097539793244587","volume":"23","author":"R Agarwala","year":"1994","unstructured":"Agarwala R, Fern\u00e1ndez-Baca D: A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed. SIAM J Comput. 1994, 23 (6): 1216-1224. 10.1137\/S0097539793244587.","journal-title":"SIAM J Comput"},{"issue":"3","key":"186_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0893-9659(92)90026-6","volume":"5","author":"A Dress","year":"1992","unstructured":"Dress A, Steel M: Convex tree realizations of partitions. Appl Math Lett. 1992, 5 (3): 3-6. 10.1016\/0893-9659(92)90026-6.","journal-title":"Appl Math Lett"},{"key":"186_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.3230210104","volume":"21","author":"D Gusfield","year":"1991","unstructured":"Gusfield D: Efficient algorithms for inferring evolutionary trees. Networks. 1991, 21: 19-28. 10.1002\/net.3230210104.","journal-title":"Networks"},{"issue":"4","key":"186_CR7","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/S0097539791222171","volume":"23","author":"S Kannan","year":"1994","unstructured":"Kannan S, Warnow T: Inferring evolutionary history from DNA sequences. SIAM J Comput. 1994, 23 (4): 713-737. 10.1137\/S0097539791222171.","journal-title":"SIAM J Comput"},{"issue":"6","key":"186_CR8","doi-asserted-by":"publisher","first-page":"1749","DOI":"10.1137\/S0097539794279067","volume":"26","author":"S Kannan","year":"1997","unstructured":"Kannan S, Warnow T: A fast algorithm for the computation and enumeration of perfect phylogenies. SIAM J Comput. 1997, 26 (6): 1749-1763. 10.1137\/S0097539794279067.","journal-title":"SIAM J Comput"},{"issue":"3","key":"186_CR9","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1137\/090776305","volume":"25","author":"F Lam","year":"2011","unstructured":"Lam F, Gusfield D, Sridhar S: Generalizing the splits equivalence theorem and four Gamete condition: perfect phylogeny on three-state characters. SIAM J Discrete Math. 2011, 25 (3): 1144-1175. 10.1137\/090776305.","journal-title":"SIAM J Discrete Math"},{"issue":"9","key":"186_CR10","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.1016\/j.aml.2012.02.060","volume":"25","author":"B Shutters","year":"2012","unstructured":"Shutters B, Fern\u00e1ndez-Baca D: A simple characterization of the minimal obstruction sets for three-state perfect phylogenies. Appl Math Lett. 2012, 25 (9): 1226-1229. 10.1016\/j.aml.2012.02.060.","journal-title":"Appl Math Lett"},{"key":"186_CR11","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-1-4613-0255-1_6","volume-title":"Steiner Trees in Industry","author":"D Fern\u00e1ndez-Baca","year":"2001","unstructured":"Fern\u00e1ndez-Baca D: The Perfect Phylogeny Problem. Steiner Trees in Industry. Dordrecht: Kluwer 2001, 203-234."},{"key":"186_CR12","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S1570-8667(03)00009-1","volume":"1","author":"R Niedermeier","year":"2003","unstructured":"Niedermeier R, Rossmanith P: An efficient fixed-parameter algorithm for 3-Hitting Set. J Discrete Algorithms. 2003, 1: 89-102. 10.1016\/S1570-8667(03)00009-1.","journal-title":"J Discrete Algorithms"},{"key":"186_CR13","first-page":"387","volume-title":"Mathematics in the Archeological and Historical Sciences","author":"P Buneman","year":"1971","unstructured":"Buneman P: The recovery of trees from measurements of dissimilarity. Mathematics in the Archeological and Historical Sciences. Edinburgh: Edinburgh University Press 1971, 387-395."},{"issue":"1-2","key":"186_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0025-5564(76)90035-3","volume":"29","author":"GF Estabrook","year":"1976","unstructured":"Estabrook GF, Johnson J, McMorris FR: A mathematical foundation for the analysis of cladistic character compatibility. Math Biosci. 1976, 29 (1-2): 181-187. 10.1016\/0025-5564(76)90035-3.","journal-title":"Math Biosci"},{"key":"186_CR15","first-page":"304","volume-title":"Numerical Taxonomy, Volume G1 of Nato ASI series","author":"CA Meacham","year":"1983","unstructured":"Meacham CA: Theoretical and computational considerations of the compatibility of qualitative taxonomic characters. Numerical Taxonomy, Volume G1 of Nato ASI series. Heidelberg: Springer 1983, 304-314."},{"key":"186_CR16","first-page":"189","volume-title":"Proceedings of the 8th International Conference on Numerical Taxonomy","author":"WM Fitch","year":"1975","unstructured":"Fitch WM: Toward finding the tree of maximum parsimony. Proceedings of the 8th International Conference on Numerical Taxonomy. San Francisco: Freeman 1975, 189-230."},{"issue":"978","key":"186_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1086\/283157","volume":"111","author":"WM Fitch","year":"1977","unstructured":"Fitch WM: On the problem of discovering the most parsimonious tree. Am Nat. 1977, 111 (978): 223-257. 10.1086\/283157.","journal-title":"Am Nat"},{"key":"186_CR18","first-page":"116","volume-title":"Algorithms in Bioinformatics, Volume 6833 of Lecture Notes in Computer Science","author":"M Habib","year":"2011","unstructured":"Habib M, To TH: On a conjecture of compatibility of multi-states characters. Algorithms in Bioinformatics, Volume 6833 of Lecture Notes in Computer Science. Edited by: Przytycka T, Sagot MF. Berlin\/Heidelberg: Springer 2011, 116-127."},{"key":"186_CR19","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","volume":"9","author":"P Buneman","year":"1974","unstructured":"Buneman P: A characterization of rigid circuit graphs. Discrete Math. 1974, 9: 205-212. 10.1016\/0012-365X(74)90002-8.","journal-title":"Discrete Math"},{"issue":"2","key":"186_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1111\/j.2044-8317.1981.tb00626.x","volume":"34","author":"H Colonius","year":"1981","unstructured":"Colonius H, Schulze HH: Tree structures for proximity data. Br J Math Stat Psychol. 1981, 34 (2): 167-180. 10.1111\/j.2044-8317.1981.tb00626.x.","journal-title":"Br J Math Stat Psychol"},{"key":"186_CR21","volume-title":"Reconstruction methods for derivation trees. Master\u2019s thesis","author":"MCH Dekker","year":"1986","unstructured":"Dekker MCH: Reconstruction methods for derivation trees. Master\u2019s thesis. Amsterdam: Vrije Universiteit 1986."},{"issue":"16","key":"186_CR22","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.ipl.2012.06.001","volume":"112","author":"M Dietrich","year":"2012","unstructured":"Dietrich M, McCartin C, Semple C: Bounding the maximum size of a minimal definitive set of quartets. Inf Process Lett. 2012, 112 (16): 651-655. 10.1016\/j.ipl.2012.06.001.","journal-title":"Inf Process Lett"},{"key":"186_CR23","volume-title":"Reconstructing Evolution: New Mathematical and Computational Advances","author":"S Gr\u00fcnewald","year":"2007","unstructured":"Gr\u00fcnewald S, Huber KT: Identifying and defining trees. Reconstructing Evolution: New Mathematical and Computational Advances. Edited by: Gascuel O, Steel M. Oxford University Press, 2007."},{"key":"186_CR24","volume-title":"Personal communications","author":"M Steel","year":"2012","unstructured":"Steel M: Personal communications. 2012,"},{"issue":"3","key":"186_CR25","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0210030","volume":"10","author":"AV Aho","year":"1981","unstructured":"Aho AV, Sagiv Y, Szymanski TG, Ullman JD: Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM J Comput. 1981, 10 (3): 405-421. 10.1137\/0210030.","journal-title":"SIAM J Comput"},{"key":"186_CR26","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1006\/aama.1995.1020","volume":"16","author":"D Bryant","year":"1995","unstructured":"Bryant D, Steel M: Extension operations on sets of leaf-labelled trees. Adv Appl Math. 1995, 16: 425-453. 10.1006\/aama.1995.1020.","journal-title":"Adv Appl Math"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-8-11.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1748-7188-8-11\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-8-11.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,24]],"date-time":"2020-07-24T13:17:07Z","timestamp":1595596627000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/1748-7188-8-11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,1]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["186"],"URL":"https:\/\/doi.org\/10.1186\/1748-7188-8-11","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,1]]},"article-number":"11"}}