{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:25:36Z","timestamp":1725549936450},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540289326"},{"type":"electronic","value":"9783540318149"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11554714_1","type":"book-chapter","created":{"date-parts":[[2005,12,15]],"date-time":"2005-12-15T05:47:00Z","timestamp":1134625620000},"page":"1-10","source":"Crossref","is-referenced-by-count":3,"title":["Lower Bounds for Maximum Parsimony with Gene Order Data"],"prefix":"10.1007","author":[{"given":"Abraham","family":"Bachrach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Harrelson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radu","family":"Mihaescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satish","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Apurva","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Moret, B., Wyman, S., Bader, D., Warnow, T., Yan, M.: A new implementation and detailed study of breakpoint analysis. In: PSMB (2001)"},{"issue":"3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1089\/cmb.1998.5.555","volume":"5","author":"D. Sankoff","year":"1998","unstructured":"Sankoff, D., Blanchette, M.: Multiple genome rearrangement and breakpoint phylogeny. J. Comput. Biol.\u00a05(3), 555\u2013570 (1998)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"1_CR3","first-page":"26","volume":"12","author":"G. Bourque","year":"2002","unstructured":"Bourque, G., Pevzner, P.: Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Res.\u00a012(1), 26\u201336 (2002)","journal-title":"Genome Res"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S1570-8667(03)00077-7","volume":"2","author":"D. Bryant","year":"2004","unstructured":"Bryant, D.: A lower bound for the breakpoint phylogeny problem. Journal of Discrete Algorithms\u00a02, 229\u2013255 (2004)","journal-title":"Journal of Discrete Algorithms"},{"issue":"2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1093\/bioinformatics\/16.2.140","volume":"16","author":"P. Purdom","year":"2000","unstructured":"Purdom, P., Bradford, P., Tamura, K., Kumar, S.: Single column discrepency and dynamic max-mini optimizations for quickly finding the most parsimonious evolutionary trees. Bioinformatics\u00a016(2), 140\u2013151 (2000)","journal-title":"Bioinformatics"},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/molbev\/msi010","volume":"22","author":"B. Holland","year":"2005","unstructured":"Holland, B., Huber, K., Penny, D., Moulton, V.: The minmax squeeze: Guarenteeing a minimal tree for population data. Mol. Biol. and Evol.\u00a022(2), 235\u2013242 (2005)","journal-title":"Mol. Biol. and Evol."},{"key":"1_CR7","unstructured":"Tang, J.: A study of bounding methods for reconstructing phylogenies from gene-order data. PhD Thesis (2003)"},{"key":"1_CR8","unstructured":"Tang, J., Moret, B., Cui, L., de Pamphilis, C.: Phylogenetic reconstruction from arbitrary gene-order data. In: BIBE (2004)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Tang, J., Moret, B.: Linear programming for phylogenetic reconstruction based on gene rearrangements. In: CPM (2005)","DOI":"10.1007\/11496656_35"},{"key":"1_CR10","volume-title":"Mathematics of Evolution and Phylogeny","author":"B. Moret","year":"2004","unstructured":"Moret, B., Tang, J., Warnow, T.: Reconstructing phylogenies from gene-content and gene-order data. In: Gascuel, O. (ed.) Mathematics of Evolution and Phylogeny. Oxford Univ. Press, Oxford (2004)"},{"key":"1_CR11","unstructured":"Chaudhuri, K., Chen, K., Mihaescu, R., Rao, S.: On the tandem duplication-random loss model of genome rearrangement (in review)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Charikar, M., Motwani, R., Raghavan, P., Silverstein, C.: Constrained TSP and low power computing. In: WADS (1997)","DOI":"10.1007\/3-540-63307-3_51"},{"key":"1_CR13","unstructured":"Moret, B.: Personal communication (2005)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Lancia, G., Ravi, R.: GESTALT: Genomic steiner alignments. In: CPM (1999)","DOI":"10.1007\/3-540-48452-3_8"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Young, N.: Sequential and parallel algorithms for mixed packing and covering. In: FOCS (2001)","DOI":"10.1109\/SFCS.2001.959930"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0022-0000(82)90004-6","volume":"25","author":"P. Flajolet","year":"1982","unstructured":"Flajolet, P., Odlyzko, A.M.: The average height of binary trees and other simple trees. J. Computer System Sci.\u00a025, 171\u2013213 (1982)","journal-title":"J. Computer System Sci."},{"issue":"9","key":"1_CR17","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1093\/bioinformatics\/btg030","volume":"19","author":"Z. Bar-Joseph","year":"2003","unstructured":"Bar-Joseph, Z., Demaine, E.D., Gifford, D.K., Hamel, A.M., Jaakkola, T.S., et al.: K-ary clustering with optimal leaf ordering for gene expression data. Bioinformatics\u00a019(9), 1070\u20131078 (2003)","journal-title":"Bioinformatics"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1287\/moor.24.1.262","volume":"24","author":"R.E. Burkard","year":"1999","unstructured":"Burkard, R.E., Deineko, V.G., Woeginger, G.J.: The travelling salesman and the pq-tree. Mathematics of Operations Research\u00a024, 262\u2013272 (1999)","journal-title":"Mathematics of Operations Research"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Farach, M., Kannan, S., Warnow, T.: A robust model for finding optimal evolutionary trees. In: STOC (1993)","DOI":"10.1145\/167088.167132"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11554714_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:06:52Z","timestamp":1619507212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11554714_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540289326","9783540318149"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11554714_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}