{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:22:32Z","timestamp":1743139352245,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319436807"},{"type":"electronic","value":"9783319436814"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-43681-4_24","type":"book-chapter","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T14:51:35Z","timestamp":1470408695000},"page":"293-306","source":"Crossref","is-referenced-by-count":2,"title":["A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates"],"prefix":"10.1007","author":[{"given":"Diego P.","family":"Rubert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Feij\u00e3o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mar\u00edlia D. V.","family":"Braga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F\u00e1bio V.","family":"Martinez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,6]]},"reference":[{"issue":"8","key":"24_CR1","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":"1","key":"24_CR2","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., 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."},{"issue":"4","key":"24_CR3","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1089\/cmb.2007.A001","volume":"14","author":"S Angibaud","year":"2007","unstructured":"Angibaud, S., Fertin, G., Rusu, I., Vialette, S.: A pseudo-boolean framework for computing rearrangement distances between genomes with duplicates. J. Comput. Biol. 14(4), 379\u2013393 (2007)","journal-title":"J. Comput. Biol."},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Bioinformatics)","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/11851561_16","volume-title":"Algorithms in Bioinformatics","author":"A Bergeron","year":"2006","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: B\u00fccher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 163\u2013173. Springer, Heidelberg (2006)"},{"issue":"9","key":"24_CR5","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1089\/cmb.2010.0109","volume":"17","author":"MDV Braga","year":"2010","unstructured":"Braga, M.D.V., Stoye, J.: The solution space of sorting by DCJ. J. Comp. Biol. 17(9), 1145\u20131165 (2010)","journal-title":"J. Comp. Biol."},{"key":"24_CR6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/978-94-011-4309-7_19","volume-title":"Comparative Genomics","author":"D Bryant","year":"2000","unstructured":"Bryant, D.: The complexity of calculating exemplar distances. In: Sankoff, D., Nadeau, J.H. (eds.) Comparative Genomics, pp. 207\u2013211. Kluwer Academic Publishers, Dortrecht (2000)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: Proceedings of IEEE\/FOCS 1997, pp. 137\u2013143 (1997)","DOI":"10.1109\/SFCS.1997.646102"},{"key":"24_CR8","first-page":"18","volume":"12","author":"A Goldstein","year":"2005","unstructured":"Goldstein, A., Kolman, P., Zheng, J.: Minimum common string partition problem: hardness and approximations. Eletron. J. Comb. 12, 18 (2005). R50","journal-title":"Eletron. J. Comb."},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming men into mice (polynomial algorithm for genomic distance problem). In: Proceedings of FOCS 1995, pp. 581\u2013592 (1995)","DOI":"10.1109\/SFCS.1995.492588"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/978-3-642-16181-0_8","volume-title":"Comparative Genomics","author":"H Jiang","year":"2010","unstructured":"Jiang, H., Zheng, C., Sankoff, D., Zhu, B.: Scaffold filling under the breakpoint distance. In: Tannier, E. (ed.) RECOMB-CG 2010. LNCS, vol. 6398, pp. 83\u201392. Springer, Heidelberg (2010)"},{"issue":"1","key":"24_CR11","doi-asserted-by":"crossref","first-page":"R50","DOI":"10.37236\/968","volume":"14","author":"P Kolman","year":"2007","unstructured":"Kolman, P., Wale\u0144, T.: Reversal distance for strings with duplicates: linear time approximation using hitting set. Electron. J. Comb. 14(1), R50 (2007)","journal-title":"Electron. J. Comb."},{"issue":"Suppl 19","key":"24_CR12","doi-asserted-by":"crossref","first-page":"S13","DOI":"10.1186\/1471-2105-13-S19-S13","volume":"13","author":"M Shao","year":"2012","unstructured":"Shao, M., Lin, Y.: Approximating the edit distance for genomes with duplicate genes under DCJ, insertion and deletion. BMC Bioinform. 13(Suppl 19), S13 (2012)","journal-title":"BMC Bioinform."},{"issue":"5","key":"24_CR13","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":"24_CR14","unstructured":"Swenson, K., Marron, M., Earnest-DeYong, K., Moret, B.M.E.: Approximating the true evolutionary distance between two genomes. In: Proceedings of ALENEX\/ANALCO 2005, pp. 121\u2013129 (2005)"},{"issue":"16","key":"24_CR15","doi-asserted-by":"crossref","first-page":"3340","DOI":"10.1093\/bioinformatics\/bti535","volume":"21","author":"S Yancopoulos","year":"2005","unstructured":"Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchanges. Bioinformatics 21(16), 3340\u20133346 (2005)","journal-title":"Bioinformatics"},{"issue":"10","key":"24_CR16","doi-asserted-by":"crossref","first-page":"1311","DOI":"10.1089\/cmb.2009.0092","volume":"16","author":"S Yancopoulos","year":"2009","unstructured":"Yancopoulos, S., Friedberg, R.: DCJ path formulation for genome transformations which include insertions, deletions, and duplications. J. Comput. Biol. 16(10), 1311\u20131338 (2009)","journal-title":"J. Comput. Biol."}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-43681-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T21:34:50Z","timestamp":1600983290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-43681-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319436807","9783319436814"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-43681-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}