{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:24:33Z","timestamp":1743132273005,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319319568"},{"type":"electronic","value":"9783319319575"}],"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-31957-5_14","type":"book-chapter","created":{"date-parts":[[2016,4,7]],"date-time":"2016-04-07T13:26:45Z","timestamp":1460035605000},"page":"189-203","source":"Crossref","is-referenced-by-count":1,"title":["On Computing Breakpoint Distances for Genomes with Duplicate Genes"],"prefix":"10.1007","author":[{"given":"Mingfu","family":"Shao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard M. E.","family":"Moret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,8]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","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":"5","key":"14_CR2","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1089\/106652701753216503","volume":"8","author":"DA Bader","year":"2001","unstructured":"Bader, D.A., Moret, B.M.E., Yan, M.: A fast linear-time algorithm for inversion distance with an experimental comparison. J. Comput. Biol. 8(5), 483\u2013491 (2001)","journal-title":"J. Comput. Biol."},{"issue":"16","key":"14_CR3","doi-asserted-by":"publisher","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 interchange. Bioinformatics 21(16), 3340\u20133346 (2005)","journal-title":"Bioinformatics"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Bioinformatics)","doi-asserted-by":"publisher","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":"7","key":"14_CR5","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1038\/nrg1895","volume":"7","author":"JA Bailey","year":"2006","unstructured":"Bailey, J.A., Eichler, E.E.: Primate segmental duplications: crucibles of evolution, diversity and disease. Nat. Rev. Genet. 7(7), 552\u2013564 (2006)","journal-title":"Nat. Rev. Genet."},{"key":"14_CR6","volume-title":"The Origins of Genome Architecture","author":"M Lynch","year":"2007","unstructured":"Lynch, M.: The Origins of Genome Architecture. Sinauer, Sunderland (2007)"},{"issue":"11","key":"14_CR7","doi-asserted-by":"publisher","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":"14_CR8","unstructured":"Blin, G., Chauve, C., Fertin, G.: The breakpoint distance for signed sequences. In: Proceedings of the 1st Conference on Algorithms and Computational Methods for Biochemical and Evolutionary Networks (CompBioNets 2004), vol. 3, pp. 3\u201316 (2004)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Bioinformatics)","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-74960-8_2","volume-title":"Comparative Genomics","author":"S Angibaud","year":"2007","unstructured":"Angibaud, S., Fertin, G., Rusu, I., Th\u00e9venin, A., Vialette, S.: A pseudo-boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes. In: Tesler, G., Durand, D. (eds.) RECMOB-CG 2007. LNCS (LNBI), vol. 4751, pp. 16\u201329. Springer, Heidelberg (2007)"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1109\/TCBB.2007.1069","volume":"14","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. ACM\/IEEE Trans. Comput. Bio. Bioinf. 14, 523\u2013534 (2007)","journal-title":"ACM\/IEEE Trans. Comput. Bio. Bioinf."},{"issue":"10","key":"14_CR11","doi-asserted-by":"publisher","first-page":"2171","DOI":"10.1093\/bioinformatics\/bti327","volume":"21","author":"CT Nguyen","year":"2005","unstructured":"Nguyen, C.T., Tay, Y.C., Zhang, L.: Divide-and-conquer approach for the exemplar breakpoint distance. Bioinformatics 21(10), 2171\u20132176 (2005)","journal-title":"Bioinformatics"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/978-3-319-16706-0_31","volume-title":"Research in Computational Molecular Biology","author":"M Shao","year":"2015","unstructured":"Shao, M., Moret, B.M.E.: A fast and exact algorithm for the exemplar breakpoint distance. In: Przytycka, T.M. (ed.) RECOMB 2015. LNCS, vol. 9029, pp. 309\u2013322. Springer, Heidelberg (2015)"},{"key":"14_CR13","unstructured":"Swenson, K.M., Marron, M., Earnest-DeYoung, J.V., Moret, B.M.E.: Approximating the true evolutionary distance between genomes. In: Proceedings of the 7th SIAM Workshop on Algorithm Engineering and Experiments (ALENEX 2005), pp. 121\u2013129. SIAM Press (2005)"},{"issue":"8","key":"14_CR14","doi-asserted-by":"publisher","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":"4","key":"14_CR15","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/TCBB.2005.48","volume":"2","author":"X Chen","year":"2005","unstructured":"Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Assignment of orthologous genes via genome rearrangement. ACM\/IEEE Trans. Comput. Bio. Bioinf. 2(4), 302\u2013315 (2005)","journal-title":"ACM\/IEEE Trans. Comput. Bio. Bioinf."},{"issue":"9","key":"14_CR16","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1089\/cmb.2007.0048","volume":"14","author":"Z Fu","year":"2007","unstructured":"Fu, Z., Chen, X., Vacic, V., Nan, P., Zhong, Y., Jiang, T.: MSOAR: a high-throughput ortholog assignment system based on genome rearrangement. J. Comput. Biol. 14(9), 1160\u20131175 (2007)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1186\/1471-2105-11-10","volume":"11","author":"G Shi","year":"2010","unstructured":"Shi, G., Zhang, L., Jiang, T.: MSOAR 2.0: incorporating tandem duplications into ortholog assignment based on genome rearrangement. BMC Bioinform. 11(1), 10 (2010)","journal-title":"BMC Bioinform."},{"key":"14_CR18","unstructured":"Gurobi Optimization Inc.: Gurobi optimizer reference manual (2013)"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31957-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T19:33:04Z","timestamp":1559417584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31957-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319319568","9783319319575"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31957-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}