{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:30:53Z","timestamp":1742913053499,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031580710"},{"type":"electronic","value":"9783031580727"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-58072-7_8","type":"book-chapter","created":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T19:01:42Z","timestamp":1713121302000},"page":"153-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximum Alternating Balanced Cycle Decomposition and\u00a0Applications in\u00a0Sorting by\u00a0Intergenic Operations Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5287-2925","authenticated-orcid":false,"given":"Klairton Lima","family":"Brito","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6320-9747","authenticated-orcid":false,"given":"Alexsandro Oliveira","family":"Alexandrino","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5745-399X","authenticated-orcid":false,"given":"Gabriel","family":"Siqueira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0568-1859","authenticated-orcid":false,"given":"Andre Rodrigues","family":"Oliveira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4763-3046","authenticated-orcid":false,"given":"Ulisses","family":"Dias","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3333-6822","authenticated-orcid":false,"given":"Zanoni","family":"Dias","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,15]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-030-74432-8_9","volume-title":"Algorithms for Computational Biology","author":"AO Alexandrino","year":"2021","unstructured":"Alexandrino, A.O., Brito, K.L., Oliveira, A.R., Dias, U., Dias, Z.: Reversal distance on genomes with different gene content and intergenic regions information. In: Mart\u00edn-Vide, C., Vega-Rodr\u00edguez, M.A., Wheeler, T. (eds.) AlCoB 2021. LNCS, vol. 12715, pp. 121\u2013133. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-74432-8_9"},{"key":"8_CR2","unstructured":"Alexandrino, A.O., Brito, K.L., Oliveira, A.R., Dias, U., Dias, Z.: Reversal and indel distance with intergenic region information. IEEE\/ACM Transactions on Computational Biology and Bioinformatics, pp. 1\u201313 (2022)"},{"issue":"06","key":"8_CR3","doi-asserted-by":"publisher","first-page":"2140011","DOI":"10.1142\/S0219720021400114","volume":"19","author":"AO Alexandrino","year":"2021","unstructured":"Alexandrino, A.O., Oliveira, A.R., Dias, U., Dias, Z.: Incorporating intergenic regions into reversal and transposition distances with indels. J. Bioinform. Comput. Biol. 19(06), 2140011 (2021)","journal-title":"J. Bioinform. Comput. Biol."},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/S0097539793250627","volume":"25","author":"V Bafna","year":"1996","unstructured":"Bafna, V., Pevzner, P.A.: Genome rearrangements and sorting by reversals. SIAM J. Comput. 25(2), 272\u2013289 (1996)","journal-title":"SIAM J. Comput."},{"key":"8_CR5","unstructured":"Berman, P., F\u00fcrer, M.: Approximating maximum independent set in bounded degree graphs. In: SODA\u201994: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 365\u2013371. Society for Industrial and Applied Mathematics (1994)"},{"key":"8_CR6","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":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-48523-6_17","volume-title":"Automata, Languages and Programming","author":"P Berman","year":"1999","unstructured":"Berman, P., Karpinski, M.: On some tighter inapproximability results (extended abstract). In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 200\u2013209. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48523-6_17"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-40189-8_4","volume-title":"Pursuit of the Universal","author":"P Biller","year":"2016","unstructured":"Biller, P., Knibbe, C., Beslon, G., Tannier, E.: Comparative genomics on artificial life. In: Beckmann, A., Bienvenu, L., Jonoska, N. (eds.) CiE 2016. LNCS, vol. 9709, pp. 35\u201344. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40189-8_4"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1089\/cmb.2019.0293","volume":"27","author":"KL Brito","year":"2020","unstructured":"Brito, K.L., Jean, G., Fertin, G., Oliveira, A.R., Dias, U., Dias, Z.: Sorting by genome rearrangements on both gene order and intergenic sizes. J. Comput. Biol. 27(2), 156\u2013174 (2020)","journal-title":"J. Comput. Biol."},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.jda.2016.05.002","volume":"37","author":"L Bulteau","year":"2016","unstructured":"Bulteau, L., Fertin, G., Komusiewicz, C.: (Prefix) Reversal distance for (signed) strings with few blocks or small alphabets. J. Discret. Algorithms 37, 44\u201355 (2016)","journal-title":"J. Discret. Algorithms"},{"issue":"2","key":"8_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1009838309166","volume":"3","author":"A Caprara","year":"1999","unstructured":"Caprara, A.: On the tightness of the alternating-cycle lower bound for sorting by reversals. J. Comb. Optim. 3(2), 149\u2013182 (1999)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/S089548019731994X","volume":"12","author":"A Caprara","year":"1999","unstructured":"Caprara, A.: Sorting permutations by reversals and Eulerian cycle decompositions. SIAM J. Discret. Math. 12(1), 91\u2013110 (1999)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1023\/A:1013851611274","volume":"6","author":"A Caprara","year":"2002","unstructured":"Caprara, A., Rizzi, R.: Improved approximation for breakpoint graph decomposition and sorting by reversals. J. Comb. Optim. 6(2), 157\u2013182 (2002)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10878-010-9369-8","volume":"25","author":"X Chen","year":"2013","unstructured":"Chen, X.: On sorting unsigned permutations by double-cut-and-joins. J. Comb. Optim. 25(3), 339\u2013351 (2013)","journal-title":"J. Comb. Optim."},{"key":"8_CR15","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA (1979)"},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM 46(1), 1\u201327 (1999)","journal-title":"J. ACM"},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"CAJ Hurkens","year":"1989","unstructured":"Hurkens, C.A.J., Schrijver, A.: On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM J. Discret. Math. 2(1), 68\u201372 (1989)","journal-title":"SIAM J. Discret. Math."},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-68279-0_8","volume-title":"50 Years of Integer Programming 1958-2008","author":"RM Karp","year":"2010","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: J\u00fcnger, M., et al. (eds.) 50 Years of Integer Programming 1958-2008, pp. 219\u2013241. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_8"},{"issue":"2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/B:JOCO.0000031419.12290.2b","volume":"8","author":"G Lin","year":"2004","unstructured":"Lin, G., Jiang, T.: A further improved approximation algorithm for breakpoint graph decomposition. J. Comb. Optim. 8(2), 183\u2013194 (2004)","journal-title":"J. Comb. Optim."},{"issue":"6","key":"8_CR20","doi-asserted-by":"publisher","first-page":"2870","DOI":"10.1109\/TCBB.2020.2993002","volume":"18","author":"AR Oliveira","year":"2021","unstructured":"Oliveira, A.R., et al.: Sorting signed permutations by intergenic reversals. IEEE\/ACM Trans. Comput. Biol. Bioinform. 18(6), 2870\u20132876 (2021)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43, 425\u2013440 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-030-65775-8_12","volume-title":"Advances in Bioinformatics and Computational Biology","author":"PO Pinheiro","year":"2020","unstructured":"Pinheiro, P.O., Alexandrino, A.O., Oliveira, A.R., de Souza, C.C., Dias, Z.: Heuristics for breakpoint graph decomposition with applications in genome rearrangement problems. In: BSB 2020. LNCS, vol. 12558, pp. 129\u2013140. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65775-8_12"},{"issue":"3","key":"8_CR23","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.jda.2007.09.002","volume":"6","author":"A Rahman","year":"2008","unstructured":"Rahman, A., Shatabda, S., Hasan, M.: An approximation algorithm for sorting by reversals and transpositions. J. Discret. Algorithms 6(3), 449\u2013457 (2008)","journal-title":"J. Discret. Algorithms"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-87989-3_18","volume-title":"Comparative Genomics","author":"KM Swenson","year":"2008","unstructured":"Swenson, K.M., Lin, Yu., Rajan, V., Moret, B.M.E.: Hurdles hardly have to be heeded. In: Nelson, C.E., Vialette, S. (eds.) RECOMB-CG 2008. LNCS, vol. 5267, pp. 241\u2013251. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87989-3_18"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58072-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T13:03:02Z","timestamp":1728910982000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58072-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031580710","9783031580727"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58072-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"15 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RECOMB-CG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"RECOMB International Workshop on Comparative Genomics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Boston, MA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rcg2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}