{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T01:13:14Z","timestamp":1750122794851,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319679785"},{"type":"electronic","value":"9783319679792"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-67979-2_2","type":"book-chapter","created":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T00:31:23Z","timestamp":1505349083000},"page":"14-30","source":"Crossref","is-referenced-by-count":4,"title":["A Tractable Variant of the Single Cut or Join Distance with Duplicated Genes"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Feij\u00e3o","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aniket","family":"Mane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cedric","family":"Chauve","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,15]]},"reference":[{"key":"2_CR1","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. MIT Press, Cambridge (2009)"},{"issue":"1","key":"2_CR2","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1186\/s12864-017-3655-0","volume":"18","author":"D Wang","year":"2017","unstructured":"Wang, D., Li, D., Ning, K., Wang, L.: Core-genome scaffold comparison reveals the prevalence that inversion events are associated with pairs of inverted repeats. BMC Genom. 18(1), 268 (2017)","journal-title":"BMC Genom."},{"issue":"6217","key":"2_CR3","doi-asserted-by":"crossref","first-page":"1258522","DOI":"10.1126\/science.1258522","volume":"347","author":"D Neafsey","year":"2015","unstructured":"Neafsey, D., Waterhouse, R., et al.: Mosquito genomics. Highly evolvable malaria vectors: the genomes of 16 Anopheles mosquitoes. Science 347(6217), 1258522 (2015)","journal-title":"Science"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In: 27th Annual ACM Symposium on the Theory of Computing (STOC 1995), pp. 178\u2013189 (1995)","DOI":"10.1145\/225058.225112"},{"issue":"5","key":"2_CR5","doi-asserted-by":"crossref","first-page":"1318","DOI":"10.1109\/TCBB.2011.34","volume":"8","author":"P Feij\u00e3o","year":"2011","unstructured":"Feij\u00e3o, P., Meidanis, J.: SCJ: a breakpoint-like distance that simplifies several rearrangement problems. IEEE\/ACM Trans. Comput. Biol. Bioinform. 8(5), 1318\u20131329 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"1","key":"2_CR6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1186\/1748-7188-8-21","volume":"8","author":"P Silva da","year":"2013","unstructured":"da Silva, P., Machado, R., Dantas, S., Braga, M.: DCJ-indel and DCJ-substitution distances with distinct operation costs. Algorithms Mol. Biol. 8(1), 21 (2013)","journal-title":"Algorithms Mol. Biol."},{"issue":"9","key":"2_CR7","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1089\/cmb.2011.0118","volume":"18","author":"M Braga","year":"2011","unstructured":"Braga, M., Willing, E., Stoye, J.: Double cut and join with insertions and deletions. J. Comput. Biol. 18(9), 1167\u20131184 (2011)","journal-title":"J. Comput. Biol."},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1186\/1471-2105-10-120","volume":"10","author":"E Tannier","year":"2009","unstructured":"Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal median and halving problems under various different genomic distances. BMC Bioinform. 10, 120 (2009)","journal-title":"BMC Bioinform."},{"issue":"5","key":"2_CR9","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1089\/cmb.2014.0096","volume":"22","author":"M Shao","year":"2015","unstructured":"Shao, M., Lin, Y., Moret, B.: An exact algorithm to compute the double-cut-and-join distance for genomes with duplicate genes. J. Comput. Biol. 22(5), 425\u2013435 (2015)","journal-title":"J. Comput. Biol."},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1186\/1748-7188-8-6","volume":"8","author":"PEC Compeau","year":"2013","unstructured":"Compeau, P.E.C.: DCJ-Indel sorting revisited. Algorithms Mol. Biol. 8, 6 (2013)","journal-title":"Algorithms Mol. Biol."},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1186\/s13015-017-0095-y","volume":"12","author":"D Rubert","year":"2017","unstructured":"Rubert, D., Feij\u00e3o, P., Braga, M., Stoye, J., Martinez, F.: Approximating the DCJ distance of balanced genomes in linear time. Algorithms Mol. Biol. 12, 3 (2017)","journal-title":"Algorithms Mol. Biol."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-94-011-4309-7_19","volume-title":"Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and Evolution of Gene Families","author":"D Bryant","year":"2000","unstructured":"Bryant, D.: The complexity of calculating exemplar distances. In: Sankoff, D., Nadeau, J.H. (eds.) Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and Evolution of Gene Families, vol. 1, pp. 207\u2013211. Springer, Dordrecht (2000). doi: 10.1007\/978-94-011-4309-7_19"},{"key":"2_CR13","unstructured":"Blin, G., Chauve, C., Fertin, G.: The breakpoint distance for signed sequences. In: Algorithms and Computational Methods for Biochemical and Evolutionary Networks (CompBioNets 2004). Text in Algorithms, vol. 3, pp. 3\u201316 (2004)"},{"issue":"1","key":"2_CR14","doi-asserted-by":"crossref","first-page":"19","DOI":"10.7155\/jgaa.00175","volume":"13","author":"S Angibaud","year":"2009","unstructured":"Angibaud, S., Fertin, G., Rusu, I., Thevenin, A., Vialette, S.: On the approximability of comparing genomes with duplicates. J. Graph Algorithms Appl. 13(1), 19\u201353 (2009)","journal-title":"J. Graph Algorithms Appl."},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-642-00202-1_31","volume-title":"WALCOM: Algorithms and Computation","author":"G Blin","year":"2009","unstructured":"Blin, G., Fertin, G., Sikora, F., Vialette, S.: The ExemplarBreakpointDistance for non-trivial genomes cannot be approximated. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol. 5431, pp. 357\u2013368. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-00202-1_31"},{"issue":"5","key":"2_CR16","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1089\/cmb.2015.0193","volume":"23","author":"M Shao","year":"2016","unstructured":"Shao, M., Moret, B.: A fast and exact algorithm for the exemplar breakpoint distance. J. Comput. Biol. 23(5), 337\u2013346 (2016)","journal-title":"J. Comput. Biol."},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Shao, M., Moret, B.: On computing breakpoint distances for genomes with duplicate genes. J. Comput. Biol. (2016, ahead of print). doi: 10.1089\/cmb.2016.0149","DOI":"10.1089\/cmb.2016.0149"},{"issue":"7","key":"2_CR18","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1089\/cmb.2014.0200","volume":"22","author":"Z Wei","year":"2014","unstructured":"Wei, Z., Zhu, D., Wang, L.: A dynamic programming algorithm for (1,2)-exemplar breakpoint distance. J. Comput. Biol. 22(7), 666\u2013676 (2014)","journal-title":"J. Comput. Biol."},{"issue":"8","key":"2_CR19","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1089\/cmb.2008.0061","volume":"15","author":"S Angibaud","year":"2008","unstructured":"Angibaud, S., Fertin, G., Rusu, I., Th\u00e9venin, A., Vialette, S.: Efficient tools for computing the number of breakpoints and the number of adjacencies between two genomes with duplicate genes. J. Comput. Biol. 15(8), 1093\u20131115 (2008)","journal-title":"J. Comput. Biol."},{"issue":"2","key":"2_CR20","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1089\/cmb.2016.0045","volume":"24","author":"R Zeira","year":"2017","unstructured":"Zeira, R., Shamir, R.: Sorting by cuts, joins, and whole chromosome duplications. J. Comput. Biol. 24(2), 127\u2013137 (2017)","journal-title":"J. Comput. Biol."},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-94-011-4309-7_46","volume-title":"Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics Map, Alignment and Evolution of Gene Families","author":"D Sankoff","year":"2000","unstructured":"Sankoff, D., El-Mabrouk, N.: Duplication, rearrangement and reconciliation. In: Sankoff, D., Nadeau, J.H. (eds.) Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics Map, Alignment and Evolution of Gene Families, vol. 1, pp. 537\u2013550. Springer, Dordrecht (2000). doi: 10.1007\/978-94-011-4309-7_46"},{"issue":"11","key":"2_CR22","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1093\/bioinformatics\/15.11.909","volume":"15","author":"D Sankoff","year":"1999","unstructured":"Sankoff, D.: Genome rearrangement with gene families. Bioinformatics 15(11), 909\u2013917 (1999)","journal-title":"Bioinformatics"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-1-4471-5298-9_4","volume-title":"Models and Algorithms for Genome Evolution","author":"C Chauve","year":"2013","unstructured":"Chauve, C., El-Mabrouk, N., Gu\u00e9guen, L., Semeria, M., Tannier, E.: Duplication, rearrangement and reconciliation a follow-up 13 years later. In: Chauve, C., El-Mabrouk, N., Tannier, E. (eds.) Models and Algorithms for Genome Evolution, vol. 19, pp. 47\u201362. Springer, London (2013). doi: 10.1007\/978-1-4471-5298-9_4"},{"issue":"5","key":"2_CR24","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1093\/gbe\/evx069","volume":"9","author":"W Duchemin","year":"2017","unstructured":"Duchemin, W., Anselmetti, Y., Patterson, M., Ponty, Y., B\u00e9rard, S., Chauve, C., Scornavacca, C., Daubin, V., Tannier, E.: DeCoSTAR: reconstructing the ancestral organization of genes or genomes using reconciled phylogenies. Genome Biol. Evol. 9(5), 1312\u20131319 (2017)","journal-title":"Genome Biol. Evol."},{"key":"2_CR25","volume-title":"Matching Theory","author":"MD Plummer","year":"1986","unstructured":"Plummer, M.D., Lov\u00e1sz, L.: Matching Theory. Elsevier, Amsterdam (1986)"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Luhmann N., Lafond M., Thevenin A., Ouangraoua A., Wittler R., Chauve C.: The SCJ small parsimony problem for weighted gene adjacencies. IEEE\/ACM Trans. Comput. Biol. Bioinform. (2017, ahead of print). doi: 10.1109\/TCBB.2017.2661761","DOI":"10.1109\/TCBB.2017.2661761"},{"key":"2_CR27","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.tcs.2014.07.027","volume":"552","author":"I Mikl\u00f3s","year":"2014","unstructured":"Mikl\u00f3s, I., Kiss, S., Tannier, E.: Counting and sampling SCJ small parsimony solutions. Theoret. Comput. Sci. 552, 83\u201398 (2014)","journal-title":"Theoret. Comput. Sci."},{"issue":"Suppl 14","key":"2_CR28","doi-asserted-by":"crossref","first-page":"S7","DOI":"10.1186\/1471-2105-16-S14-S7","volume":"16","author":"P Biller","year":"2015","unstructured":"Biller, P., Gu\u00e9guen, L., Tannier, E.: Moments of genome evolution by Double Cut-and-Join. BMC Bioinform. 16(Suppl 14), S7 (2015)","journal-title":"BMC Bioinform."}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67979-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T08:50:42Z","timestamp":1570092642000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67979-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319679785","9783319679792"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67979-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}