{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:47:12Z","timestamp":1725472032218},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540482819"},{"type":"electronic","value":"9783540482826"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11916277_31","type":"book-chapter","created":{"date-parts":[[2006,10,17]],"date-time":"2006-10-17T14:32:59Z","timestamp":1161095579000},"page":"452-466","source":"Crossref","is-referenced-by-count":3,"title":["Constructing Camin-Sokal Phylogenies Via Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"Kavanagh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugenia","family":"Ternovska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1n","family":"Ma\u0148uch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohong","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arvind","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","volume-title":"Molecular Evolution: A Phylogenetic Approach","author":"D. Roderic","year":"1998","unstructured":"Roderic, D., Page, M., Holmes, E.: Molecular Evolution: A Phylogenetic Approach. Blackwell Science, Oxford, UK (1998)"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Haplotyping as perfect phylogeny: conceptual framework and efficient solutions. In: RECOMB 2002: Proc. of the sixth annual int\u2019l conf. on Comp. biology, pp. 166\u2013175 (2002)","DOI":"10.1145\/565196.565218"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Erdem, E., Lifschitz, V., Nakhleh, L., Ringe, D.: Reconstructing the evolutionary history of indo-european languages using answer set programming. In: Proc., Practical Aspects of Declarative Languages: 5th Int\u2019l Symposium, pp. 160\u2013176 (2003)","DOI":"10.1007\/3-540-36388-2_12"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0025-5564(82)90027-X","volume":"59","author":"M. Hendy","year":"1982","unstructured":"Hendy, M., Penny, D.: Branch and bound algorithms to determine minimal evolutionary trees. Mathematical Biosciences\u00a059, 277\u2013290 (1982)","journal-title":"Mathematical Biosciences"},{"key":"31_CR5","unstructured":"Felsenstein, J.: Phylip home page (1980), \n                  \n                    http:\/\/evolution.genetics.washington.edu\/phylip"},{"key":"31_CR6","unstructured":"Swofford, D.: Paup* 4.0 Phylogenetic Analysis Using Parsimony (*and Other Methods) (2001)"},{"key":"31_CR7","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc., Int\u2019l Logic Programming Conference and Symposium, pp. 1070\u20131080 (1988)"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence\u00a025, 241\u2013273 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"31_CR9","volume-title":"The Logic Programming Paradigm: A 25-Year Perspective","author":"V. Marek","year":"1999","unstructured":"Marek, V., Truszczynski, M.: Stable logic programming - an alternative logic programming paradigm. In: Apt, K.R., Marek, V.W., Truszczynski, M., Warren, D.S. (eds.) The Logic Programming Paradigm: A 25-Year Perspective. Springer, Heidelberg (1999)"},{"key":"31_CR10","unstructured":"Niemel\u00e4, I., Simons, P., Syrj\u00e4nen, T.: Smodels: A system for answer set programming. In: Proc. 8th Int\u2019l Workshop on Non-Monotonic Reasoning, Breckenridge, Colorado, April 9-11 (2000)"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-24609-1_32","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"Y. Lierler","year":"2003","unstructured":"Lierler, Y., Maratea, M.: Cmodels-2: SAT-based answer set solver enhanced to non-tight programs. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS, vol.\u00a02923, pp. 346\u2013350. Springer, Heidelberg (2003)"},{"key":"31_CR12","unstructured":"Eck, R., Dayhoff, M.: Atlas of protein sequence and structure. National Biomedical Research Foundation (1966)"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"311","DOI":"10.2307\/2406441","volume":"19","author":"J. Camin","year":"1965","unstructured":"Camin, J., Sokal, R.: A method for deducing branching sequences in phylogeny. Evolution\u00a019, 311\u2013326 (1965)","journal-title":"Evolution"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1101\/gr.2114704","volume":"14","author":"L. Edwards-Ingram","year":"2004","unstructured":"Edwards-Ingram, L., Gent, M., Hoyle, D., Hayes, A., Stateva, L., Oliver, S.: Comparative genomic hybridization provides new insights into the molecular taxonomy of the saccharomyces sensu stricto complex. Genome Research\u00a014, 1043\u20131051 (2004)","journal-title":"Genome Research"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s00239-003-2486-6","volume":"57","author":"H. Nozaki","year":"2003","unstructured":"Nozaki, H., Ohta, N., Matsuzaki, M., Misumi, O., Kuroiwa, T.: Phylogeny of plastids based on cladistic analysis of gene loss inferred from complete plastid genome sequences. J. Molecular Evolution\u00a057, 377\u2013382 (2003)","journal-title":"J. Molecular Evolution"},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1003584905461","volume":"104","author":"A. Pacak","year":"1998","unstructured":"Pacak, A., Fiedorow, P., Dabert, J., Szweykowska-Kuli\u0144ska, Z.: RAPD technique for taxonomic studies of pellia epiphylla-complex (hepaticae, metzgeriales). Genetica\u00a0104, 179\u2013187 (1998)","journal-title":"Genetica"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0025-5564(86)90161-6","volume":"81","author":"W. Day","year":"1986","unstructured":"Day, W., Johnson, D., Sankoff, D.: The computational complexity of inferring rooted phylogenies by parsimony. Mathematical Biosciences\u00a081, 33\u201342 (1986)","journal-title":"Mathematical Biosciences"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Agarwala, R., Fernandez-Baca, D.: A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed. SIAM Journal on Computing, 1216\u20131224 (1994)","DOI":"10.1137\/S0097539793244587"},{"key":"31_CR19","unstructured":"Hellman, M., Tripathi, N., Henz, S., Lindholm, A., Weigel, D., Breden, F., Dreyer, C.: Unpublished data (2006)"},{"key":"31_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-30557-6_5","volume-title":"Practical Aspects of Declarative Languages","author":"D.R. Brooks","year":"2005","unstructured":"Brooks, D.R., Erdem, E., Minett, J.W., Ringe, D.: Character-based cladistics and answer set programming. In: Hermenegildo, M.V., Cabeza, D. (eds.) PADL 2004. LNCS, vol.\u00a03350, pp. 37\u201351. Springer, Heidelberg (2005)"},{"key":"31_CR21","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1093\/bioinformatics\/16.2.140","volume":"2","author":"W. Purdom Jr.","year":"2000","unstructured":"Purdom Jr., W., Bradford, P., Tamura, K., Kumar, S.: Single column discrepancy and dynamic max-mini optimization for quickly finding the most parsimonious evolutionary trees. Bioinformatics\u00a02, 140\u2013151 (2000)","journal-title":"Bioinformatics"},{"key":"31_CR22","unstructured":"Yan, M., Bader, D.A.: Fast character optimization in parsimony phylogeny reconstruction. Technical report (2003)"},{"key":"31_CR23","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1016\/S0022-0000(02)00007-7","volume":"65","author":"B. Moret","year":"2002","unstructured":"Moret, B., Tang, J., Wang, L., Warnow, T.: Steps toward accurate reconstruction of phylogenies from gene-order data. J. Comput. Syst. Sci.\u00a065, 508\u2013525 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"31_CR24","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1017\/S1471068403001765","volume":"3","author":"E. Erdem","year":"2003","unstructured":"Erdem, E., Lifschitz, V.: Tight logic programs. Theory and Practice of Logic Programming\u00a03, 499\u2013518 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"key":"31_CR25","unstructured":"Syrj\u00e4nen, T.: Lparse user\u2019s manual (1998), \n                  \n                    http:\/\/www.tcs.hut.fi\/Software\/smodels\/"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11916277_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:42:24Z","timestamp":1619494944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11916277_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540482819","9783540482826"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11916277_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}