{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:29Z","timestamp":1740099149950,"version":"3.37.3"},"publisher-location":"Cham","reference-count":18,"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_19","type":"book-chapter","created":{"date-parts":[[2018,9,13]],"date-time":"2018-09-13T10:58:18Z","timestamp":1536836298000},"page":"233-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Faster Recovery of Approximate Periods over Edit Distance"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2477-1702","authenticated-orcid":false,"given":"Tomasz","family":"Kociumaka","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0067-6401","authenticated-orcid":false,"given":"Jakub","family":"Radoszewski","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9162-6724","authenticated-orcid":false,"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2207-0053","authenticated-orcid":false,"given":"Juliusz","family":"Straszy\u0144ski","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7369-3309","authenticated-orcid":false,"given":"Tomasz","family":"Wale\u0144","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1988-3507","authenticated-orcid":false,"given":"Wiktor","family":"Zuba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,14]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2017.10.026","volume":"710","author":"A Amir","year":"2018","unstructured":"Amir, A., Amit, M., Landau, G.M., Sokol, D.: Period recovery of strings over the Hamming and edit distances. Theor. Comput. Sci. 710, 2\u201318 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2017.10.026","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/2390176.2390189","volume":"9","author":"A Amir","year":"2012","unstructured":"Amir, A., Eisenberg, E., Levy, A., Porat, E., Shapira, N.: Cycle detection and correction. ACM Trans. Algorithms 9(1), 13:1\u201313:20 (2012). https:\/\/doi.org\/10.1145\/2390176.2390189","journal-title":"ACM Trans. Algorithms"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.tcs.2017.07.021","volume":"700","author":"M Amit","year":"2017","unstructured":"Amit, M., Crochemore, M., Landau, G.M., Sokol, D.: Locating maximal approximate runs in a string. Theor. Comput. Sci. 700, 45\u201362 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2017.07.021","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0304-3975(93)90159-Q","volume":"119","author":"A Apostolico","year":"1993","unstructured":"Apostolico, A., Ehrenfeucht, A.: Efficient detection of quasiperiodicities in strings. Theor. Comput. Sci. 119(2), 247\u2013265 (1993). https:\/\/doi.org\/10.1016\/0304-3975(93)90159-Q","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0020-0190(91)90056-N","volume":"39","author":"A Apostolico","year":"1991","unstructured":"Apostolico, A., Farach, M., Iliopoulos, C.S.: Optimal superprimitivity testing for strings. Inf. Process. Lett. 39(1), 17\u201320 (1991). https:\/\/doi.org\/10.1016\/0020-0190(91)90056-N","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"19_CR6","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0020-0190(92)90111-8","volume":"44","author":"D Breslauer","year":"1992","unstructured":"Breslauer, D.: An on-line string superprimitivity test. Inf. Process. Lett. 44(6), 345\u2013347 (1992). https:\/\/doi.org\/10.1016\/0020-0190(92)90111-8","journal-title":"Inf. Process. Lett."},{"key":"19_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511546853","volume-title":"Algorithms on Strings","author":"M Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007). https:\/\/doi.org\/10.1017\/cbo9780511546853"},{"key":"19_CR8","doi-asserted-by":"publisher","DOI":"10.1142\/4838","volume-title":"Jewels of Stringology","author":"M Crochemore","year":"2003","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2003). https:\/\/doi.org\/10.1142\/4838"},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(93)90245-5","volume":"45","author":"VA Fischetti","year":"1993","unstructured":"Fischetti, V.A., Landau, G.M., Sellers, P.H., Schmidt, J.P.: Identifying periodic occurrences of a template with applications to protein structure. Inf. Process. Lett. 45(1), 11\u201318 (1993). https:\/\/doi.org\/10.1016\/0020-0190(93)90245-5","journal-title":"Inf. Process. Lett."},{"key":"19_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997). https:\/\/doi.org\/10.1017\/cbo9780511574931"},{"key":"19_CR11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099","volume-title":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","year":"2012","unstructured":"Kociumaka, T., Kubica, M., Radoszewski, J., Rytter, W., Wale\u0144, T.: A linear time algorithm for seeds computation. In: Rabani, Y. (ed.) 23rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 2012, pp. 1095\u20131112. SIAM (2012). https:\/\/doi.org\/10.1137\/1.9781611973099"},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/s0304-3975(02)00448-6","volume":"303","author":"RM Kolpakov","year":"2003","unstructured":"Kolpakov, R.M., Kucherov, G.: Finding approximate repetitions under Hamming distance. Theor. Comput. Sci. 303(1), 135\u2013156 (2003). https:\/\/doi.org\/10.1016\/s0304-3975(02)00448-6","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"19_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"GM Landau","year":"1989","unstructured":"Landau, G.M., Vishkin, U.: Fast parallel and serial approximate string matching. J. Algorithms 10(2), 157\u2013169 (1989). https:\/\/doi.org\/10.1016\/0196-6774(89)90010-2","journal-title":"J. Algorithms"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00453-001-0062-2","volume":"32","author":"Y Li","year":"2002","unstructured":"Li, Y., Smyth, W.F.: Computing the cover array in linear time. Algorithmica 32(1), 95\u2013106 (2002). https:\/\/doi.org\/10.1007\/s00453-001-0062-2","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"19_CR15","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0304-3975(03)00211-1","volume":"304","author":"VY Popov","year":"2003","unstructured":"Popov, V.Y.: The approximate period problem for DNA alphabet. Theor. Comput. Sci. 304(1\u20133), 443\u2013447 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(03)00211-1","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/S0304-3975(00)00365-0","volume":"262","author":"JS Sim","year":"2001","unstructured":"Sim, J.S., Iliopoulos, C.S., Park, K., Smyth, W.F.: Approximate periods of strings. Theor. Comput. Sci. 262(1), 557\u2013568 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(00)00365-0","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1093\/bioinformatics\/btl309","volume":"23","author":"D Sokol","year":"2007","unstructured":"Sokol, D., Benson, G., Tojeira, J.: Tandem repeats over the edit distance. Bioinformatics 23(2), 30\u201335 (2007). https:\/\/doi.org\/10.1093\/bioinformatics\/btl309","journal-title":"Bioinformatics"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.tcs.2013.04.021","volume":"525","author":"D Sokol","year":"2014","unstructured":"Sokol, D., Tojeira, J.: Speeding up the detection of tandem repeats over the edit distance. Theor. Comput. Sci. 525, 103\u2013110 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2013.04.021","journal-title":"Theor. Comput. Sci."}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,28]],"date-time":"2018-09-28T07:24:37Z","timestamp":1538119477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00479-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030004781","9783030004798"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00479-8_19","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"}}]}}