{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T23:40:07Z","timestamp":1751845207491,"version":"3.41.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030008338"},{"type":"electronic","value":"9783030008345"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00834-5_2","type":"book-chapter","created":{"date-parts":[[2018,9,7]],"date-time":"2018-09-07T03:53:16Z","timestamp":1536292396000},"page":"28-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Rooted SCJ Median with Single Gene Duplications"],"prefix":"10.1007","author":[{"given":"Aniket C.","family":"Mane","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Lafond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Feij\u00e3o","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":[[2018,9,8]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.7155\/jgaa.00175","volume":"13","author":"S Angibaud","year":"2009","unstructured":"Angibaud, S., Fertin, G., Rusu, I., Th\u00e9venin, 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_CR2","unstructured":"Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness of short symmetric instances of MAX-3SAT. Technical report TR03-049, Electronic Colloquium on Computational Complexity (ECCC) (2003)"},{"key":"2_CR3","first-page":"25","volume":"8","author":"M Blanchette","year":"1997","unstructured":"Blanchette, M., Bourque, G., Sankoff, D.: Breakpoint phylogenies. Genome Inform. 8, 25\u201334 (1997)","journal-title":"Genome Inform."},{"issue":"4","key":"2_CR4","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1109\/TCBB.2007.1069","volume":"4","author":"G Blin","year":"2007","unstructured":"Blin, G., Chauve, C., Fertin, G., Rizzi, R., Vialette, S.: Comparing genomes with duplications: a computational complexity point of view. IEEE\/ACM Trans. Comput. Biol. Bioinform. 4(4), 523\u2013534 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1137\/120866439","volume":"27","author":"SC Boyd","year":"2013","unstructured":"Boyd, S.C., Haghighi, M.: Mixed and circular multichromosomal genomic median problem. SIAM J. Discret. Math. 27(1), 63\u201374 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-94-011-4309-7","volume-title":"Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and the 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 the Evolution of Gene Families, pp. 207\u2013211. Springer, Dordrecht (2000). https:\/\/doi.org\/10.1007\/978-94-011-4309-7"},{"issue":"2","key":"2_CR7","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. J. Discret. Algorithms 2(2), 229\u2013255 (2004)","journal-title":"J. Discret. Algorithms"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Davin, A.A., Tricou, T., Tannier, E., de Vienne, D.M., Szollosi, G.J.: Zombi: a simulator of species, genes and genomes that accounts for extinct lineages. bioRxiv (2018). https:\/\/doi.org\/10.1101\/339473","DOI":"10.1101\/339473"},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1186\/s13015-017-0106-z","volume":"12","author":"D Doerr","year":"2017","unstructured":"Doerr, D., Balaban, M., Feij\u00e3o, P., Chauve, C.: The gene family-free median of three. Algorithms Mol. Biol. 12(1), 14:1\u201314:14 (2017)","journal-title":"Algorithms Mol. Biol."},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-319-67979-2_2","volume-title":"Comparative Genomics - 15th International Workshop, RECOMB CG 2017","author":"P Feij\u00e3o","year":"2017","unstructured":"Feij\u00e3o, P., Mane, A.C., Chauve, C.: A tractable variant of the single cut or join distance with duplicated genes. In: Meidanis, J., Nakhleh, L. (eds.) RECOMB CG 2017. LNCS, vol. 10562, pp. 14\u201330. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67979-2_2"},{"issue":"5","key":"2_CR11","doi-asserted-by":"publisher","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."},{"key":"2_CR12","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262062824.001.0001","volume-title":"Combinatorics of Genome Rearrangements. Computational Molecular Biology","author":"G Fertin","year":"2009","unstructured":"Fertin, G., Labarre, A., Rusu, I., Tannier, E., Vialette, S.: Combinatorics of Genome Rearrangements. Computational Molecular Biology. MIT Press, Cambridge (2009)"},{"issue":"1749","key":"2_CR13","doi-asserted-by":"publisher","first-page":"5048","DOI":"10.1098\/rspb.2012.1108","volume":"279","author":"FA Kondrashov","year":"2012","unstructured":"Kondrashov, F.A.: Gene duplication as a mechanism of genomic adaptation to a changing environment. Proc. R. Soc. Lond. B Biol. Sci. 279(1749), 5048\u20135057 (2012)","journal-title":"Proc. R. Soc. Lond. B Biol. Sci."},{"issue":"1","key":"2_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/cmb.2013.0004","volume":"21","author":"J Kov\u00e1c","year":"2014","unstructured":"Kov\u00e1c, J.: On the complexity of rearrangement problems under the breakpoint distance. J. Comput. Biol. 21(1), 1\u201315 (2014)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"2_CR15","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1186\/1745-6150-6-11","volume":"6","author":"A Levasseur","year":"2011","unstructured":"Levasseur, A., Pontarotti, P.: The role of duplications in the evolution of genomes highlights the need for evolutionary-based approaches in comparative genomics. Biol. Direct 6(1), 11 (2011)","journal-title":"Biol. Direct"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Luhmann, N., Lafond, M., Th\u00e8venin, A., Ouangraoua, A., Wittler, R., Chauve, C.: The SCJ small parsimony problem for weighted gene adjacencies. IEEE\/ACM Trans. Comput. Biol. Bioinform. (2017). https:\/\/doi.org\/10.1109\/TCBB.2017.2661761","DOI":"10.1109\/TCBB.2017.2661761"},{"issue":"12","key":"2_CR17","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1038\/ng.3435","volume":"47","author":"R Ming","year":"2015","unstructured":"Ming, R., VanBuren, R., Wai, C.M., et al.: The pineapple genome and the evolution of CAM photosynthesis. Nat. Genet. 47(12), 1435\u20131442 (2015)","journal-title":"Nat. Genet."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Moret, B.M.E., Wyman, S.K., Bader, D.A., Warnow, T.J., Yan, M.: A new implementation and detailed study of breakpoint analysis. In: Pacific Symposium on Biocomputing, pp. 583\u2013594 (2001)","DOI":"10.1142\/9789814447362_0056"},{"issue":"6217","key":"2_CR19","doi-asserted-by":"publisher","first-page":"1258522","DOI":"10.1126\/science.1258522","volume":"347","author":"D Neafsey","year":"2015","unstructured":"Neafsey, D., Waterhouse, R., Abai, M., et al.: Highly evolvable malaria vectors: the genomes of 16 Anopheles mosquitoes. Science 347(6217), 1258522 (2015)","journal-title":"Science"},{"key":"2_CR20","unstructured":"Pe\u2019er, I., Shamir, R.: The median problems for breakpoints are np-complete. Technical report TR98-071, Electronic Colloquium on Computational Complexity (ECCC) (1998)"},{"issue":"1","key":"2_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0129054196000026","volume":"7","author":"D Sankoff","year":"1996","unstructured":"Sankoff, D., Sundaram, G., Kececioglu, J.D.: Steiner points in the space of genome rearrangements. Int. J. Found. Comput. Sci. 7(1), 1\u20139 (1996)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2_CR22","doi-asserted-by":"publisher","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 different genomic distances. BMC Bioinform. 10, 120 (2009)","journal-title":"BMC Bioinform."},{"issue":"2","key":"2_CR23","doi-asserted-by":"publisher","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."}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00834-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T23:19:42Z","timestamp":1751843982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00834-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030008338","9783030008345"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00834-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}