{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:02Z","timestamp":1759638962033,"version":"3.37.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030004781"},{"type":"electronic","value":"9783030004798"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00479-8_24","type":"book-chapter","created":{"date-parts":[[2018,9,13]],"date-time":"2018-09-13T10:58:18Z","timestamp":1536836298000},"page":"297-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Better Heuristic Algorithms for the Repetition Free LCS and Other Variants"],"prefix":"10.1007","author":[{"given":"Radu Stefan","family":"Mincu","sequence":"first","affiliation":[]},{"given":"Alexandru","family":"Popa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,14]]},"reference":[{"issue":"12","key":"24_CR1","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1016\/j.dam.2009.04.023","volume":"158","author":"Said S. Adi","year":"2010","unstructured":"Adi, S.S., et al.: Repetition-free longest common subsequence. Discret. Appl. Math. 158(12), 1315\u20131324 (2010). https:\/\/doi.org\/10.1016\/j.dam.2009.04.023, traces from LAGOS07 IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"24_CR2","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10732-012-9196-4","volume":"18","author":"DV Andrade","year":"2012","unstructured":"Andrade, D.V., Resende, M.G.C., Werneck, R.F.: Fast local search for the maximum independent set problem. J. Heuristics 18(4), 525\u2013547 (2012). https:\/\/doi.org\/10.1007\/s10732-012-9196-4","journal-title":"J. Heuristics"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-662-07675-0_8","volume-title":"Handbook of Formal Languages","author":"A Apostolico","year":"1997","unstructured":"Apostolico, A.: String editing and longest common subsequences. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 361\u2013398. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-662-07675-0_8"},{"key":"24_CR4","doi-asserted-by":"publisher","unstructured":"Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: Proceedings Seventh International Symposium on String Processing and Information Retrieval, SPIRE 2000, pp. 39\u201348 (2000). https:\/\/doi.org\/10.1109\/SPIRE.2000.878178","DOI":"10.1109\/SPIRE.2000.878178"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-319-30698-8_4","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"C Blum","year":"2016","unstructured":"Blum, C., Blesa, M.J.: Construct, merge, solve and adapt: application to the repetition-free longest common subsequence problem. In: Chicano, F., Hu, B., Garc\u00eda-S\u00e1nchez, P. (eds.) EvoCOP 2016. LNCS, vol. 9595, pp. 46\u201357. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30698-8_4"},{"issue":"3","key":"24_CR6","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s10732-017-9329-x","volume":"24","author":"C Blum","year":"2018","unstructured":"Blum, C., Blesa, M.J.: A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem. J. Heuristics 24(3), 551\u2013579 (2018). https:\/\/doi.org\/10.1007\/s10732-017-9329-x","journal-title":"J. Heuristics"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-11683-9_7","volume-title":"Artificial Evolution","author":"C Blum","year":"2014","unstructured":"Blum, C., Blesa, M.J., Calvo, B.: Beam-ACO for the repetition-free longest common subsequence problem. In: Legrand, P., Corsini, M.-M., Hao, J.-K., Monmarch\u00e9, N., Lutton, E., Schoenauer, M. (eds.) EA 2013. LNCS, vol. 8752, pp. 79\u201390. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11683-9_7"},{"issue":"4","key":"24_CR8","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1109\/TCBB.2007.1066","volume":"4","author":"P Bonizzoni","year":"2007","unstructured":"Bonizzoni, P., Della Vedova, G., Dondi, R., Fertin, G., Rizzi, R., Vialette, S.: Exemplar longest common subsequence. IEEE\/ACM Trans. Comput. Biol. Bioinform. 4(4), 535\u2013543 (2007). https:\/\/doi.org\/10.1109\/TCBB.2007.1066","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"20","key":"24_CR9","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/j.ipl.2010.07.015","volume":"110","author":"P Bonizzoni","year":"2010","unstructured":"Bonizzoni, P., Vedova, G.D., Dondi, R., Pirola, Y.: Variants of constrained longest common subsequence. Inf. Process. Lett. 110(20), 877\u2013881 (2010). https:\/\/doi.org\/10.1016\/j.ipl.2010.07.015","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"24_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/j.orl.2013.09.002","volume":"41","author":"M Castelli","year":"2013","unstructured":"Castelli, M., Beretta, S., Vanneschi, L.: A hybrid genetic algorithm for the repetition free longest common subsequence problem. Oper. Res. Lett. 41(6), 644\u2013649 (2013). https:\/\/doi.org\/10.1016\/j.orl.2013.09.002","journal-title":"Oper. Res. Lett."},{"key":"24_CR11","doi-asserted-by":"publisher","unstructured":"Castelli, M., Dondi, R., Mauri, G., Zoppis, I.: The longest filled common subsequence problem. In: K\u00e4rkk\u00e4inen, J., Radoszewski, J., Rytter, W. (eds.) 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 78, pp. 14:1\u201314:13. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2017.14","DOI":"10.4230\/LIPIcs.CPM.2017.14"},{"issue":"4","key":"24_CR12","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ipl.2004.02.008","volume":"90","author":"FY Chin","year":"2004","unstructured":"Chin, F.Y., Santis, A.D., Ferrara, A.L., Ho, N., Kim, S.: A simple algorithm for the constrained sequence problems. Inf. Process. Lett. 90(4), 175\u2013179 (2004). https:\/\/doi.org\/10.1016\/j.ipl.2004.02.008","journal-title":"Inf. Process. Lett."},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.dam.2015.07.005","volume":"210","author":"Cristina G. Fernandes","year":"2016","unstructured":"Fernandes, C.G., Kiwi, M.: Repetition-free longest common subsequence of random sequences. Discret. Appl. Math. 210, 75\u201387 (2016). https:\/\/doi.org\/10.1016\/j.dam.2015.07.005. lAGOS13: Seventh Latin-American Algorithms, Graphs, and Optimization Symposium, Playa del Carmen, Mxico (2013)","journal-title":"Discrete Applied Mathematics"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-540-69068-9_24","volume-title":"Combinatorial Pattern Matching","author":"Z Gotthilf","year":"2008","unstructured":"Gotthilf, Z., Hermelin, D., Lewenstein, M.: Constrained LCS: hardness and approximation. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol. 5029, pp. 255\u2013262. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69068-9_24"},{"issue":"4","key":"24_CR15","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1145\/322033.322044","volume":"24","author":"DS Hirschberg","year":"1977","unstructured":"Hirschberg, D.S.: Algorithms for the longest common subsequence problem. J. ACM (JACM) 24(4), 664\u2013675 (1977). https:\/\/doi.org\/10.1145\/322033.322044","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"24_CR16","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D Maier","year":"1978","unstructured":"Maier, D.: The complexity of some problems on subsequences and supersequences. J. ACM 25(2), 322\u2013336 (1978). https:\/\/doi.org\/10.1145\/322063.322075","journal-title":"J. ACM"},{"issue":"4","key":"24_CR17","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.ipl.2003.07.001","volume":"88","author":"YT Tsai","year":"2003","unstructured":"Tsai, Y.T.: The constrained longest common subsequence problem. Inf. Process. Lett. 88(4), 173\u2013176 (2003). https:\/\/doi.org\/10.1016\/j.ipl.2003.07.001","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"24_CR18","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168\u2013173 (1974). https:\/\/doi.org\/10.1145\/321796.321811","journal-title":"J. ACM"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ic.2017.06.001","volume":"255","author":"M Xiao","year":"2017","unstructured":"Xiao, M., Nagamochi, H.: Exact algorithms for maximum independent set. Inf. Comput. 255, 126\u2013146 (2017). https:\/\/doi.org\/10.1016\/j.ic.2017.06.001","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00479-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,28]],"date-time":"2018-09-28T07:29:09Z","timestamp":1538119749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00479-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030004781","9783030004798"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00479-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Peru","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/eventos.spc.org.pe\/spire2018\/","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"51","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"43% - 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"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}