{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:28:19Z","timestamp":1725582499762},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212598"},{"type":"electronic","value":"9783642212604"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21260-4_41","type":"book-chapter","created":{"date-parts":[[2011,4,29]],"date-time":"2011-04-29T04:26:59Z","timestamp":1304051219000},"page":"440-451","source":"Crossref","is-referenced-by-count":1,"title":["Towards a Characterisation of the Generalised Cladistic Character Compatibility Problem for Non-branching Character Trees"],"prefix":"10.1007","author":[{"given":"J\u00e1n","family":"Ma\u0148uch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Murray","family":"Patterson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arvind","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"41_CR1","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1137\/S0097539793244587","volume":"26","author":"R. Agarwala","year":"1994","unstructured":"Agarwala, R., Fernandez-Baca, D.: A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed. SIAM J. Computing\u00a026(6), 1216\u20131224 (1994)","journal-title":"SIAM J. Computing"},{"issue":"4","key":"41_CR2","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1089\/cmb.1995.2.515","volume":"2","author":"C. Benham","year":"1995","unstructured":"Benham, C., Kannan, S., Paterson, M., Warnow, T.: Hen\u2019s teeth and whale\u2019s feet: Generalized characters and their compatibility. J. Computational Biology\u00a02(4), 515\u2013525 (1995)","journal-title":"J. Computational Biology"},{"key":"41_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-60044-2_31","volume-title":"Combinatorial Pattern Matching","author":"C. Benham","year":"1995","unstructured":"Benham, C., Kannan, S., Warnow, T.: Of chicken teeth and mouse eyes, or generalized character compatibility. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol.\u00a0937, pp. 17\u201326. Springer, Heidelberg (1995)"},{"key":"41_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/3-540-55719-9_80","volume-title":"Automata, Languages and Programming","author":"H. Bodlaender","year":"1992","unstructured":"Bodlaender, H., Fellows, M., Warnow, T.: Two strikes against perfect phylogeny. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 273\u2013283. Springer, Heidelberg (1992)"},{"issue":"3","key":"41_CR5","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Computer and System Sciences\u00a013(3), 335\u2013379 (1976)","journal-title":"J. Computer and System Sciences"},{"key":"41_CR6","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF00276095","volume":"10","author":"G. Estabrook","year":"1980","unstructured":"Estabrook, G., McMorris, F.: When is one estimate of evolutionary relationships a refinement of the another? J. Mathematical Biology\u00a010, 327\u2013373 (1980)","journal-title":"Mathematical Biology"},{"issue":"4","key":"41_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1086\/412935","volume":"57","author":"J. Felsenstein","year":"1982","unstructured":"Felsenstein, J.: Numerical methods for inferring evolutionary trees. The Quarterly Review of Biology\u00a057(4), 379\u2013404 (1982)","journal-title":"The Quarterly Review of Biology"},{"key":"41_CR8","first-page":"202","volume":"10","author":"L. Figuera","year":"1995","unstructured":"Figuera, L., Pandolfo, M., Dunne, P., Cantu, J., Patel, P.: Mapping the congenital generalized hypertrichosis locus to chromosome Xq24-q27.1. Nature\u00a010, 202\u2013207 (1995)","journal-title":"Nature"},{"key":"41_CR9","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D. Fulkerson","year":"1965","unstructured":"Fulkerson, D., Gross, O.: Incidence matrices and interval graphs. Pacific J. Mathematics\u00a015, 835\u2013855 (1965)","journal-title":"Pacific J. Mathematics"},{"key":"41_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"41_CR11","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1016\/j.dam.2005.09.020","volume":"155","author":"J. Gramm","year":"2007","unstructured":"Gramm, J., Nierhoff, T., Sharan, R., Tantau, T.: Haplotyping with missing data via perfect path phylogenies. Discrete Applied Mathematics\u00a0155, 788\u2013805 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"41_CR12","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\u00a021, 19\u201328 (1991)","journal-title":"Networks"},{"key":"41_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-02008-7_18","volume-title":"Research in Computational Molecular Biology","author":"D. Gusfield","year":"2009","unstructured":"Gusfield, D.: The multi-state perfect phylogeny problem with missing and removable data: Solutions via integer-programming and chordal graph theory. In: Batzoglou, S. (ed.) RECOMB 2009. LNCS, vol.\u00a05541, pp. 236\u2013252. Springer, Heidelberg (2009)"},{"key":"41_CR14","first-page":"78","volume":"103","author":"C. Janis","year":"1994","unstructured":"Janis, C.: The sabertooth\u2019s repeat performances. Natural History\u00a0103, 78\u201382 (1994)","journal-title":"Natural History"},{"issue":"4","key":"41_CR15","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. Computing\u00a023(4), 713\u2013737 (1994)","journal-title":"SIAM J. Computing"},{"key":"41_CR16","unstructured":"Kannan, S., Warnow, T.: A fast algorithm for the computation and enumeration of perfect phylogenies. In: Proc. of SODA 1995, pp. 595\u2013603 (1995)"},{"key":"41_CR17","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1126\/science.7352302","volume":"207","author":"E. Kollar","year":"1980","unstructured":"Kollar, E., Fisher, C.: Tooth induction in chick epithelium: Expression of quiescent genes for enamel synthesis. Science\u00a0207, 993\u2013995 (1980)","journal-title":"Science"},{"key":"41_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-642-02882-3_27","volume-title":"Computing and Combinatorics","author":"J. Ma\u0148uch","year":"2009","unstructured":"Ma\u0148uch, J., Patterson, M., Gupta, A.: On the Generalised Character Compatibility Problem for Non-branching Character Trees. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol.\u00a05609, pp. 268\u2013276. Springer, Heidelberg (2009)"},{"issue":"2","key":"41_CR19","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0895480192229273","volume":"7","author":"F. McMorris","year":"1994","unstructured":"McMorris, F., Warnow, T., Wimer, T.: Triangulating vertex colored graphs. SIAM J. Discrete Mathematics\u00a07(2), 296\u2013306 (1994)","journal-title":"SIAM J. Discrete Mathematics"},{"key":"41_CR20","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1016\/j.dam.2005.09.020","volume":"155","author":"J. Meidanis","year":"2007","unstructured":"Meidanis, J., Porto, O., Telles, G.P.: On the consecutive ones property. Discrete Applied Mathematics\u00a0155, 788\u2013805 (2007)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"41_CR21","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0208008","volume":"8","author":"J. Opatrny","year":"1979","unstructured":"Opatrny, J.: Total ordering problem. SIAM J. Computing\u00a08(1), 111\u2013114 (1979)","journal-title":"SIAM J. Computing"},{"key":"41_CR22","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1137\/S0097539702406510","volume":"33","author":"I. Pe\u2019er","year":"2004","unstructured":"Pe\u2019er, I., Pupko, T., Shamir, R., Sharan, R.: Incomplete directed perfect phylogeny. SIAM J. Computing\u00a033, 590\u2013607 (2004)","journal-title":"SIAM J. Computing"},{"key":"41_CR23","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. Classification\u00a09, 91\u2013116 (1992)","journal-title":"J. Classification"},{"key":"41_CR24","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0168-9525(93)90205-V","volume":"9","author":"J. Trowsdale","year":"1993","unstructured":"Trowsdale, J.: Genomic structure and function in the MHC. Trends in Genetics\u00a09, 117\u2013122 (1993)","journal-title":"Trends in Genetics"},{"key":"41_CR25","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1006\/jagm.1994.1018","volume":"16","author":"T. Warnow","year":"1994","unstructured":"Warnow, T.: Tree compatibility and inferring evolutionary history. J. Algorithms\u00a016, 388\u2013407 (1994)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21260-4_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T05:32:14Z","timestamp":1558589534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21260-4_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212598","9783642212604"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21260-4_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}