{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T20:07:20Z","timestamp":1757621240821,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819502172"},{"type":"electronic","value":"9789819502189"}],"license":[{"start":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T00:00:00Z","timestamp":1754179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T00:00:00Z","timestamp":1754179200000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-0218-9_25","type":"book-chapter","created":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T21:09:40Z","timestamp":1754168980000},"page":"341-354","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Approximation Algorithm and\u00a0Hardness Result for\u00a0Sorting Unsigned Strings by\u00a0Symmetric Reversals"],"prefix":"10.1007","author":[{"given":"Wenfeng","family":"Lai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haitao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daming","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","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)","DOI":"10.1093\/hmg\/ddg223"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Bailey, J.A., Baertsch, R., James Kent, W., Haussler, D., Eichler, E.E.: Hotspots of mammalian chromosomal evolution. Genome Biol. 5, 1\u20137 (2004)","DOI":"10.1186\/gb-2004-5-4-r23"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Bergeron, A.: A very elementary presentation of the Hannenhalli\u2013Pevzner theory. Discrete Appl. Math. 146(2), 134\u2013145 (2005). 12th Annual Symposium on Combinatorial Pattern Matching","DOI":"10.1016\/j.dam.2004.04.010"},{"key":"25_CR4","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"},{"key":"25_CR5","unstructured":"Berman, P., Karpinski, M., Scott, A.: Approximation hardness of short symmetric instances of MAX-3SAT. Technical report (2004)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Sorting permutations by reversals and Eulerian cycle decompositions. Siam J. Discrete Math. (1999)","DOI":"10.1137\/S089548019731994X"},{"key":"25_CR7","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, 25\u201327 January 1998, San Francisco, California, USA, pp. 244\u2013252. ACM\/SIAM (1998)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Dudek, B., Gawrychowski, P., Starikovskaya, T.: Sorting signed permutations by reversals in nearly-linear time. In: 2024 Symposium on Simplicity in Algorithms (SOSA), pp. 199\u2013214. SIAM (2024)","DOI":"10.1137\/1.9781611977936.19"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Fertin, G., Labarre, A., Rusu, I., Tannier, E., Vialette, S.: Combinatorics of genome rearrangements. In: Computational Molecular Biology. MIT Press (2009)","DOI":"10.7551\/mitpress\/9780262062824.001.0001"},{"key":"25_CR10","unstructured":"Han, Y.: Improving the efficiency of sorting by reversals. In: Proceedings 2006 International Conference on Bioinformatics & Computational Biology (BIOCOMP 2006), pp. 406\u2013409 (2006)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM (JACM) 46(1), 1\u201327 (1999)","DOI":"10.1145\/300515.300516"},{"issue":"1","key":"25_CR12","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":"25_CR13","doi-asserted-by":"crossref","unstructured":"Lai, W., Jiang, H., Zhu, D., Zhu, B.: On sorting by unsigned symmetric reversals. In: Proceedings of the International Computing and Combinatorics Conference, pp. 421\u2013432. Springer (2024)","DOI":"10.1007\/978-981-96-1090-7_34"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Li, T., Jiang, H., Zhu, B., Wang, L., Zhu, D.: Flanked block-interchange distance on strings. IEEE\/ACM Trans. Comput. Biol. Bioinf. (2), 21 (2024)","DOI":"10.1109\/TCBB.2024.3351440"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Longo, M.S., Carone, D.M.: NISC comparative sequencing\u00a0program eGreen@ NHGRI.\u00a0nih.gov. In: Green, E.D., O\u2019Neill, M.J., O\u2019Neill, R.J. (eds.) Distinct Retroelement Classes Define Evolutionary Breakpoints Demarcating Sites of Evolutionary Novelty. BMC Genomics 10, 1\u201314 (2009)","DOI":"10.1186\/1471-2164-10-334"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Pevzner, P.A., Waterman, M.S.: Open combinatorial problems in computational molecular biology. In: Proceedings Third Israel Symposium on the Theory of Computing and Systems, pp. 158\u2013173. IEEE (1995)","DOI":"10.1109\/ISTCS.1995.377035"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/jbiol162","volume":"8","author":"D Sankoff","year":"2009","unstructured":"Sankoff, D.: The where and wherefore of evolutionary breakpoints. J. Biol. 8, 1\u20133 (2009)","journal-title":"J. Biol."},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Sankoff, D., Leduc, G., Antoine, N., Paquin, B., Franz Lang, B., Cedergren, R.: Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome. Proc. Nat. Acad. Sci. 89(14), 6575\u20136579 (1992)","DOI":"10.1073\/pnas.89.14.6575"},{"issue":"1","key":"25_CR19","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1186\/s13015-018-0127-2","volume":"13","author":"P Simonaitis","year":"2018","unstructured":"Simonaitis, P., Swenson, K.M.: Finding local genome rearrangements. Algorithms Mol. Biol. 13(1), 9 (2018)","journal-title":"Algorithms Mol. Biol."},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Small, K., Iber, J., Warren, S.T.: Emerin deletion reveals a common X-chromosome inversion mediated by inverted repeats. Nat. Genet. 16(1), 96\u201399 (1997)","DOI":"10.1038\/ng0597-96"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Sun, C., Jiang, H., Wang, L., Zhu, D.: Can the 1.375 approximation ratio of unsigned genomes distances be improved? In: Proceedings of the International Computing and Combinatorics Conference, pp. 3\u201315. Springer (2024)","DOI":"10.1007\/978-981-96-1090-7_1"},{"issue":"1","key":"25_CR22","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1186\/s13015-016-0065-9","volume":"11","author":"KM Swenson","year":"2016","unstructured":"Swenson, K.M., Simonaitis, P., Blanchette, M.: Models and algorithms for genome rearrangement with positional constraints. Algorithms Mol. Biol. 11(1), 13 (2016)","journal-title":"Algorithms Mol. Biol."},{"issue":"6\u20137","key":"25_CR23","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. Discret. Appl. Math. 155(6\u20137), 881\u2013888 (2007)","journal-title":"Discret. Appl. Math."},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Thomas, A., Varr\u00e9, J.-S., Ouangraoua, A.: Genome dedoubling by DCJ and reversal. BMC Bioinf. 12, 1\u20139 (2011)","DOI":"10.1186\/1471-2105-12-S9-S20"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Tong, X., et al.: Cabbage can\u2019t always be transformed into turnip: decision algorithms for sorting by symmetric reversals. In: International Computing and Combinatorics Conference, pp. 279\u2013294. Springer (2023)","DOI":"10.1007\/978-3-031-49193-1_21"},{"key":"25_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s12864-016-3406-7","volume":"18","author":"D Wang","year":"2017","unstructured":"Wang, D., Li, S., Guo, F., Ning, K., Wang, L.: Core-genome scaffold comparison reveals the prevalence that inversion events are associated with pairs of inverted repeats. BMC Genomics 18, 1\u201313 (2017)","journal-title":"BMC Genomics"},{"key":"25_CR27","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1186\/s12859-018-2268-1","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 Bioinf. 19, 11\u201319 (2018)","journal-title":"BMC Bioinf."},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Wenger, A.M., Peluso, P., Rowell, W.J., et\u00a0al.: Accurate circular consensus long-read sequencing improves variant detection and assembly of a human genome. Nat. Biotechnol. 37(10), 1155\u20131162 (2019)","DOI":"10.1038\/s41587-019-0217-9"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0218-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T12:43:09Z","timestamp":1757335389000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0218-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"ISBN":["9789819502172","9789819502189"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0218-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"3 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/cocoon2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}