{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T15:47:59Z","timestamp":1779896879346,"version":"3.53.1"},"publisher-location":"Singapore","reference-count":32,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819970735","type":"print"},{"value":"9789819970742","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-7074-2_23","type":"book-chapter","created":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T10:02:39Z","timestamp":1696672959000},"page":"292-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Sorting by\u00a0Flanked Transpositions"],"prefix":"10.1007","author":[{"given":"Huixiu","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Tong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haitao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daming","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,10,8]]},"reference":[{"key":"23_CR1","first-page":"697","volume":"46","author":"A Sturtevant","year":"1926","unstructured":"Sturtevant, A.: A crossover reducer in Drosophila melanogaster due to inversion of a section of the third chromosome. Biol. Zent. Bl. 46, 697\u2013702 (1926)","journal-title":"Biol. Zent. Bl."},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1073\/pnas.22.7.448","volume":"22","author":"A Sturtevant","year":"1936","unstructured":"Sturtevant, A., Dobzhansky, T.: Inversions in the third chromosome of wild races of drosophila pseudoobscura, and their use in the study of the history of the species. Proc. Nat. Acad. Sci. USA 22, 448\u2013450 (1936)","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1073\/pnas.81.3.814","volume":"81","author":"JH Nadeau","year":"1984","unstructured":"Nadeau, J.H., Taylor, B.A.: Lengths of chromosomal segments conserved since divergence of man and mouse. Proc. Nat. Acad. Sci. USA 81, 814\u2013818 (1984)","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"23_CR4","first-page":"1474","volume":"8","author":"C Makaroff","year":"1988","unstructured":"Makaroff, C., Palmer, J.: Mitochondrial DNA rearrangements and transcriptional alternatives in the male sterile cytoplasm of Ogura radish. Mol. Cell. Biol. 8, 1474\u20131480 (1988)","journal-title":"Mol. Cell. Biol."},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF02143500","volume":"27","author":"J Palmer","year":"1988","unstructured":"Palmer, J., Herbon, L.: Plant mitochondrial DNA evolves rapidly in structure, but slowly in sequence. J. Mol. Evolut. 27, 87\u201397 (1988)","journal-title":"J. Mol. Evolut."},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"6575","DOI":"10.1073\/pnas.89.14.6575","volume":"89","author":"D Sankoff","year":"1992","unstructured":"Sankoff, D., Leduc, G., Antoine, N., Paquin, B., Lang, B.F., Cedergran, R.: Gene order comparisons for phylogenetic interferce: evolution of the mitochondrial genome. Proc. Nat. Acad. Sci. USA 89, 6575\u20136579 (1992)","journal-title":"Proc. Nat. Acad. Sci. USA"},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-5193(82)90384-8","volume":"99","author":"GA Watterson","year":"1982","unstructured":"Watterson, G.A., Ewens, W.J., Hall, T.E., Morgan, A.: The chromosome inversion problem. J. Theor. Biol. 99(1), 1\u20137 (1982)","journal-title":"J. Theor. Biol."},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM 46(1), 1\u201327 (1999)","journal-title":"J. ACM"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Sorting by reversals is difficult. In: Proceedings of the first annual international Conference on Computational Molecular Biology, pp. 75\u201383 (1997)","DOI":"10.1145\/267521.267531"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Berman, P., Karpinski, M.: On some tighter inapproximability results (extended abstract). Languages, and Programming. In: International Colloquium on Automata (1999)","DOI":"10.1007\/3-540-48523-6_17"},{"issue":"1","key":"23_CR11","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01188586","volume":"13","author":"J Kececioglu","year":"1995","unstructured":"Kececioglu, J., Sankoff, D.: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica 13(1), 180\u2013210 (1995)","journal-title":"Algorithmica"},{"key":"23_CR12","unstructured":"Christie, D.A.: A 3\/2-approximation algorithm for sorting by reversals. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 244\u2013252 (1998)"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45749-6_21","volume-title":"Algorithms \u2014 ESA 2002","author":"P Berman","year":"2002","unstructured":"Berman, P., Hannenhalli, S., Karpinski, M.: 1.375-approximation algorithm for sorting by reversals. In: M\u00f6hring, R., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 200\u2013210. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45749-6_21"},{"issue":"3","key":"23_CR14","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1137\/S0097539798334207","volume":"29","author":"H Kaplan","year":"2000","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: A faster and simpler algorithm for sorting signed permutations by reversals. SIAM J. Comput. 29(3), 880\u2013892 (2000)","journal-title":"SIAM J. Comput."},{"issue":"6\u20137","key":"23_CR15","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.dam.2005.02.033","volume":"155","author":"E Tannier","year":"2007","unstructured":"Tannier, E., Bergeron, A., Sagot, M.-F.: Advances on sorting by reversals. Dis. Appli. Math. 155(6\u20137), 881\u2013892 (2007)","journal-title":"Dis. Appli. Math."},{"issue":"2","key":"23_CR16","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/S089548019528280X","volume":"11","author":"V Bafna","year":"1998","unstructured":"Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. Discrete Math. 11(2), 224\u2013240 (1998)","journal-title":"SIAM J. Discrete Math."},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Hartman, T., Shamir, R.: A simpler and faster 1.5-approximation algorithm for sorting by transpositions. Inform. Comput. 204, 275\u2013290 (2006)","DOI":"10.1016\/j.ic.2005.09.002"},{"issue":"3","key":"23_CR18","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1273340.1273341","volume":"3","author":"J Feng","year":"2007","unstructured":"Feng, J., Zhu, D.: Faster algorithms for sorting by transpositions and sorting by block-interchanges. ACM Trans. Algorithms 3(3), 25 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Elias, I., Hartman, T.: A 1.375-approximation algorithm for sorting by transpositions. IEEE\/ACM Trans. Comput. Biol. Bioinform. 3(4), 369\u2013379 (2006)","DOI":"10.1109\/TCBB.2006.44"},{"issue":"3","key":"23_CR20","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1137\/110851390","volume":"26","author":"L Bulteau","year":"2012","unstructured":"Bulteau, L., Fertin, G., Rusu, I.: Sorting by transpositions is difficult. SIAM J. Discret. Math. 26(3), 1148\u20131180 (2012)","journal-title":"SIAM J. Discret. Math."},{"issue":"1\u20133","key":"23_CR21","first-page":"289","volume":"241","author":"H Eriksson","year":"2001","unstructured":"Eriksson, H., Eriksson, K., Karlander, J., Svensson, L., Wastlund, J.: Sorting a bridge hand. Discret. Appl. Math. 241(1\u20133), 289\u2013300 (2001)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"23_CR22","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1186\/1471-2164-10-334","volume":"10","author":"MS Longo","year":"2009","unstructured":"Longo, M.S., Carone, D.M., Green, E.D., O\u2019Neill, M.J., O\u2019Neill, R.J., et al.: Distinct retroelement classes define evolutionary breakpoints demarcating sites of evolutionary novelty. BMC Genomics 10(1), 334 (2009)","journal-title":"BMC Genomics"},{"key":"23_CR23","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1186\/jbiol162","volume":"8","author":"D Sankoff","year":"2009","unstructured":"Sankoff, D.: The where and wherefore of evolutionary breakpoints. J. Biol. 8, 66 (2009)","journal-title":"J. Biol."},{"issue":"9","key":"23_CR24","doi-asserted-by":"publisher","first-page":"S20","DOI":"10.1186\/1471-2105-12-S9-S20","volume":"12","author":"A Thomas","year":"2011","unstructured":"Thomas, A., Varr\u00e9, J.S., Ouangraoua, A.: Genome dedoubling by dcj and reversal. BMC Bioinform. 12(9), S20 (2011)","journal-title":"BMC Bioinform."},{"issue":"4","key":"23_CR25","doi-asserted-by":"publisher","first-page":"R23","DOI":"10.1186\/gb-2004-5-4-r23","volume":"5","author":"JA Bailey","year":"2004","unstructured":"Bailey, J.A., Baertsch, R., Kent, W.J., Haussler, D., Eichler, E.E.: Hotspots of mammalian chromosomal evolution. Genome Biol. 5(4), R23 (2004)","journal-title":"Genome Biol."},{"issue":"17","key":"23_CR26","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1093\/hmg\/ddg223","volume":"12","author":"L Armengol","year":"2003","unstructured":"Armengol, L., Pujana, M.A., Cheung, J., Scherer, S.W., Estivill, X.: Enrichment of segmental duplications in regions of breaks of synteny between the human and mouse genomes suggest their involvement in evolutionary rearrangements. Hum. Mol. Genet. 12(17), 2201\u20132208 (2003)","journal-title":"Hum. Mol. Genet."},{"key":"23_CR27","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1038\/ng0597-96","volume":"16","author":"K Small","year":"1997","unstructured":"Small, K., Iber, J., Warren, S.T.: Emerin deletion reveals a common X-chromosome inversion mediated by inverted repeats. Nat. Genet. 16, 96\u201399 (1997)","journal-title":"Nat. Genet."},{"issue":"9","key":"23_CR28","first-page":"11","volume":"19","author":"D Wang","year":"2018","unstructured":"Wang, D., Wang, L.: Grsr: a tool for deriving genome rearrangement scenarios from multiple unichromosomal genome sequences. BMC Bioinform. 19(9), 11\u201319 (2018)","journal-title":"BMC Bioinform."},{"key":"23_CR29","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1186\/s12864-017-3655-0","volume":"18","author":"D Wang","year":"2017","unstructured":"Wang, D., Li, S., Guo, F., Wang, L.: Core genome scaffold comparison reveals the prevalence that inversion events are associated with pairs of inverted repeats. BMC Genomics 18, 268 (2017)","journal-title":"BMC Genomics"},{"key":"23_CR30","unstructured":"Vineet, B., Pavel P.A.: Sorting permutations by tanspositions. In: Proceedings of the sixth annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1995), pp. 614\u2013623 (1995)"},{"key":"23_CR31","unstructured":"Han, Y.: Improving the efficiency of sorting by reversals. In: Proceedings of the 2006 International Conference Bioinformatics & Computational Biology (BIOCOMP 2006), pp. 406\u2013409 (2006)"},{"key":"23_CR32","doi-asserted-by":"crossref","unstructured":"Tong, X.: Men Can\u2019t Always be Transformed into Mice: Decision Algorithms and Complexity for Sorting by Symmetric Reversals. arXiv:2302.03797 (2023)","DOI":"10.1007\/978-3-031-49193-1_21"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-7074-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,23]],"date-time":"2023-12-23T14:03:51Z","timestamp":1703340231000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-7074-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819970735","9789819970742"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-7074-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISBRA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Bioinformatics Research and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isbra2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mangul-lab-usc.github.io\/ISBRA23\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"89","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}