{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:08:56Z","timestamp":1742951336519,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370632"},{"type":"electronic","value":"9783642370649"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37064-9_12","type":"book-chapter","created":{"date-parts":[[2013,3,15]],"date-time":"2013-03-15T08:07:12Z","timestamp":1363334832000},"page":"116-127","source":"Crossref","is-referenced-by-count":5,"title":["Duplication-Loss Genome Alignment: Complexity and Algorithm"],"prefix":"10.1007","author":[{"given":"Billel","family":"Benzaid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Dondi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"El-Mabrouk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P. Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoretical Computer Science\u00a0237(1-2), 123\u2013134 (2000)","journal-title":"Theoretical Computer Science"},{"key":"12_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/3-540-48194-X_9","volume-title":"Combinatorial Pattern Matching","author":"A. Bergeron","year":"2001","unstructured":"Bergeron, A.: A Very Elementary Presentation of the Hannenhalli-Pevzner Theory. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 106\u2013117. Springer, Heidelberg (2001)"},{"key":"12_CR4","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 Research\u00a012, 26\u201336 (2002)","journal-title":"Genome Research"},{"key":"12_CR5","unstructured":"Canzar, S., Andreotti, S.: A branch-and-cut algorithm for the 2-species duplication-loss phylogeny problem. CoRR abs\/1208.2698 (2012)"},{"key":"12_CR6","first-page":"291","volume-title":"Mathematics of Evolution and Phylogeny","author":"N. El-Mabrouk","year":"2005","unstructured":"El-Mabrouk, N.: Genome rearrangement with gene families. In: Mathematics of Evolution and Phylogeny, pp. 291\u2013320. Oxford University Press, Oxford (2005)"},{"key":"12_CR7","series-title":"Methods in Molecular Biology","volume-title":"Evolutionary Genomics: Statistical and Computational Methods","author":"N. El-Mabrouk","year":"2012","unstructured":"El-Mabrouk, N., Sankoff, D.: Analysis of Gene Order Evolution beyond Single-Copy Genes. In: Evolutionary Genomics: Statistical and Computational Methods. Methods in Molecular Biology. Springer (Humana), New York (2012)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45123-4_20","volume-title":"Combinatorial Pattern Matching","author":"N. El-Mabrouk","year":"2000","unstructured":"El-Mabrouk, N.: Genome Rearrangement by Reversals and Insertions\/Deletions of Contiguous Segments. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 222\u2013234. Springer, Heidelberg (2000)"},{"key":"12_CR9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/9780262062824.001.0001","volume-title":"Combinatorics of genome rearrangements","author":"G. Fertin","year":"2009","unstructured":"Fertin, G., Labarre, A., Rusu, I., Tannier, E., Vialette, S.: Combinatorics of genome rearrangements. The MIT Press, Cambridge (2009)"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"48","author":"S. Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Journal of the ACM\u00a048, 1\u201327 (1999)","journal-title":"Journal of the ACM"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-29627-7_10","volume-title":"Research in Computational Molecular Biology","author":"P. Holloway","year":"2012","unstructured":"Holloway, P., Swenson, K., Ardell, D., El-Mabrouk, N.: Evolution of Genome Organization by Duplication and Loss: An Alignment Approach. In: Chor, B. (ed.) RECOMB 2012. LNCS, vol.\u00a07262, pp. 94\u2013112. Springer, Heidelberg (2012)"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"1557","DOI":"10.1101\/gr.5383506","volume":"16","author":"J. Ma","year":"2007","unstructured":"Ma, J., Zhang, L., Suh, B., Raney, B., Burhans, R., Kent, W., Blanchette, M., Haussler, D., Miller, W.: Reconstructing contiguous regions of an ancestral genome. Genome Research\u00a016, 1557\u20131565 (2007)","journal-title":"Genome Research"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-45071-8_54","volume-title":"Computing and Combinatorics","author":"M. Marron","year":"2003","unstructured":"Marron, M., Swenson, K.M., Moret, B.M.E.: Genomic Distances Under Deletions and Insertions. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 537\u2013547. Springer, Heidelberg (2003)"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1093\/bioinformatics\/17.suppl_1.S165","volume":"173","author":"B. Moret","year":"2001","unstructured":"Moret, B., Wang, L., Warnow, T., Wyman, S.: New approaches for reconstructing phylogenies from gene order data. Bioinformatics\u00a0173, S165\u2013S173 (2001)","journal-title":"Bioinformatics"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BFb0045092","volume-title":"Computing and Combinatorics","author":"D. Sankoff","year":"1997","unstructured":"Sankoff, D., Blanchette, M.: The Median Problem for Breakpoints in Comparative Genomics. In: Jiang, T., Lee, D.T. (eds.) COCOON 1997. LNCS, vol.\u00a01276, pp. 251\u2013264. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37064-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T11:21:07Z","timestamp":1676632867000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-37064-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370632","9783642370649"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37064-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}