{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,19]],"date-time":"2026-10-19T22:08:15Z","timestamp":1792447695578,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540879886","type":"print"},{"value":"9783540879893","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87989-3_17","type":"book-chapter","created":{"date-parts":[[2009,3,17]],"date-time":"2009-03-17T11:19:16Z","timestamp":1237288756000},"page":"226-240","source":"Crossref","is-referenced-by-count":7,"title":["On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios"],"prefix":"10.1007","author":[{"given":"Anne","family":"Bergeron","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julia","family":"Mixtacki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"11","key":"17_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1371\/journal.pcbi.0030209","volume":"3","author":"M. Alekseyev","year":"2007","unstructured":"Alekseyev, M., Pevzner, P.A.: Are there rearrangement hotspots in the human genome? PLoS Comput. Biol.\u00a03(11), e209 (2007)","journal-title":"PLoS Comput. Biol."},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/S0097539793250627","volume":"25","author":"V. Bafna","year":"1996","unstructured":"Bafna, V., Pevzner, P.: Genome rearrangements and sorting by reversals. SIAM J. Computing\u00a025(2), 272\u2013289 (1996)","journal-title":"SIAM J. Computing"},{"key":"17_CR3","series-title":"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.\u00a04175, pp. 163\u2013173. Springer, Heidelberg (2006)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-69068-9_8","volume-title":"Combinatorial Pattern Matching","author":"A. Bergeron","year":"2008","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: HP distance via Double Cut and Join distance. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol.\u00a05029, pp. 56\u201368. Springer, Heidelberg (2008)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.A.: 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"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ipl.2007.04.011","volume":"104","author":"G. Jean","year":"2007","unstructured":"Jean, G., Nikolski, M.: Genome rearrangements: a correct algorithm for optimal capping. Inf. Process. Lett.\u00a0104(1), 14\u201320 (2007)","journal-title":"Inf. Process. Lett."},{"issue":"1\/2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01188586","volume":"13","author":"J.D. Kececioglu","year":"1995","unstructured":"Kececioglu, J.D., Sankoff, D.: Exact and approximation algorithms for sorting by reversals with application to genome rearrangement. Algorithmica\u00a013(1\/2), 180\u2013210 (1995)","journal-title":"Algorithmica"},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1142\/S0219720003000198","volume":"1","author":"M. Ozery-Flato","year":"2003","unstructured":"Ozery-Flato, M., Shamir, R.: Two notes on genome rearrangements. J. Bioinf. Comput. Biol.\u00a01(1), 71\u201394 (2003)","journal-title":"J. Bioinf. Comput. Biol."},{"issue":"13","key":"17_CR9","doi-asserted-by":"publisher","first-page":"7672","DOI":"10.1073\/pnas.1330369100","volume":"100","author":"P. Pevzner","year":"2003","unstructured":"Pevzner, P., Tesler, G.: Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution. Proc. Natl. Acad. Sci. USA\u00a0100(13), 7672\u20137677 (2003)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Pevzner, P., Tesler, G.: Transforming men into mice: The Nadeau-Taylor chromosomal breakage model revisited. In: Proceedings of RECOMB 2003, pp. 247\u2013256 (2003)","DOI":"10.1145\/640075.640108"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-56024-6_10","volume-title":"Combinatorial Pattern Matching","author":"D. Sankoff","year":"1992","unstructured":"Sankoff, D.: Edit distances for genome comparison based on non-local operations. In: Apostolico, A., Galil, Z., Manber, U., Crochemore, M. (eds.) CPM 1992. LNCS, vol.\u00a0644, pp. 121\u2013135. Springer, Heidelberg (1992)"},{"issue":"6","key":"17_CR12","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1089\/cmb.2005.12.812","volume":"12","author":"D. Sankoff","year":"2005","unstructured":"Sankoff, D., Trinh, P.: Chromosomal breakpoint reuse in genome sequence rearrangement. J. Comput. Biol.\u00a012(6), 812\u2013821 (2005)","journal-title":"J. Comput. Biol."},{"issue":"12","key":"17_CR13","first-page":"697","volume":"46","author":"A.H. Sturtevant","year":"1926","unstructured":"Sturtevant, A.H.: A crossover reducer in Drosophila melanogaster due to inversion of a section of the third chromosome. Biologisches Zentralblatt\u00a046(12), 697\u2013702 (1926)","journal-title":"Biologisches Zentralblatt"},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/S0022-0000(02)00011-9","volume":"65","author":"G. Tesler","year":"2002","unstructured":"Tesler, G.: Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci.\u00a065(3), 587\u2013609 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"17_CR15","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1093\/bioinformatics\/18.3.492","volume":"18","author":"G. Tesler","year":"2002","unstructured":"Tesler, G.: GRIMM: Genome rearrangements web server. Bioinformatics\u00a018(3), 492\u2013493 (2002)","journal-title":"Bioinformatics"},{"issue":"16","key":"17_CR16","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\u00a021(16), 3340\u20133346 (2005)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87989-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T13:07:23Z","timestamp":1739020043000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87989-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540879886","9783540879893"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87989-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}