{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:52Z","timestamp":1759637992100,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030326852"},{"type":"electronic","value":"9783030326869"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-32686-9_18","type":"book-chapter","created":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T18:02:27Z","timestamp":1570212147000},"page":"258-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Range Shortest Unique Substring Queries"],"prefix":"10.1007","author":[{"given":"Paniz","family":"Abedin","sequence":"first","affiliation":[]},{"given":"Arnab","family":"Ganguly","sequence":"additional","affiliation":[]},{"given":"Solon P.","family":"Pissis","sequence":"additional","affiliation":[]},{"given":"Sharma V.","family":"Thankachan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,3]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Abedin, P., et al.: A linear-space data structure for Range-LCP queries in poly-logarithmic time. In: Proceedings of Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, 2\u20134 July 2018. pp. 615\u2013625 (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-94776-1_51","key":"18_CR1","DOI":"10.1007\/978-3-319-94776-1_51"},{"doi-asserted-by":"publisher","unstructured":"Allen, D.R., Thankachan, S.V., Xu, B.: A practical and efficient algorithm for the k-mismatch shortest unique substring finding problem. In: Shehu, A., Wu, C.H., Boucher, C., Li, J., Liu, H., Pop, M. (eds.) Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics, BCB 2018, Washington, DC, USA, 29 August\u201301 September 2018. pp. 428\u2013437. ACM (2018). \n                      https:\/\/doi.org\/10.1145\/3233547.3233564","key":"18_CR2","DOI":"10.1145\/3233547.3233564"},{"issue":"7","key":"18_CR3","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/j.jcss.2014.02.010","volume":"80","author":"A Amir","year":"2014","unstructured":"Amir, A., Apostolico, A., Landau, G.M., Levy, A., Lewenstein, M., Porat, E.: Range LCP. J. Comput. Syst. Sci. 80(7), 1245\u20131253 (2014). \n                      https:\/\/doi.org\/10.1016\/j.jcss.2014.02.010","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-319-23826-5_33","volume-title":"String Processing and Information Retrieval","author":"A Amir","year":"2015","unstructured":"Amir, A., Lewenstein, M., Thankachan, S.V.: Range LCP queries revisited. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds.) SPIRE 2015. LNCS, vol. 9309, pp. 350\u2013361. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-23826-5_33"},{"issue":"17","key":"18_CR5","doi-asserted-by":"publisher","first-page":"i743","DOI":"10.1093\/bioinformatics\/bty601","volume":"34","author":"LAK Ayad","year":"2018","unstructured":"Ayad, L.A.K., Pissis, S.P., Polychronopoulos, D.: CNEFinder: finding conserved non-coding elements in genomes. Bioinformatics 34(17), i743\u2013i747 (2018). \n                      https:\/\/doi.org\/10.1093\/bioinformatics\/bty601","journal-title":"Bioinformatics"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88\u201394. Springer, Heidelberg (2000). \n                      https:\/\/doi.org\/10.1007\/10719839_9"},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0222017","volume":"22","author":"O Berkman","year":"1993","unstructured":"Berkman, O., Vishkin, U.: Recursive star-tree parallel data structure. SIAM J. Comput. 22(2), 221\u2013242 (1993). \n                      https:\/\/doi.org\/10.1137\/0222017","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"publisher","unstructured":"Chan, T.M., Nekrich, Y., Rahul, S., Tsakalidis, K.: Orthogonal point location and rectangle stabbing queries in 3-D. In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, Prague, Czech Republic, 9\u201313 July 2018, pp. 31:1\u201331:14 (2018). \n                      https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.31","key":"18_CR8","DOI":"10.4230\/LIPIcs.ICALP.2018.31"},{"doi-asserted-by":"publisher","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, Miami Beach, Florida, USA, 19\u201322 October 1997, pp. 137\u2013143. IEEE Computer Society (1997). \n                      https:\/\/doi.org\/10.1109\/SFCS.1997.646102","key":"18_CR9","DOI":"10.1109\/SFCS.1997.646102"},{"doi-asserted-by":"publisher","unstructured":"Ganguly, A., Hon, W., Shah, R., Thankachan, S.V.: Space-time trade-offs for the shortest unique substring problem. In: 27th International Symposium on Algorithms and Computation, ISAAC 2016, Sydney, Australia, 12\u201314 December 2016, pp. 34:1\u201334:13 (2016). \n                      https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2016.34","key":"18_CR10","DOI":"10.4230\/LIPIcs.ISAAC.2016.34"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2017.08.002","volume":"700","author":"A Ganguly","year":"2017","unstructured":"Ganguly, A., Hon, W., Shah, R., Thankachan, S.V.: Space-time trade-offs for finding shortest unique substrings and maximal unique matches. Theor. Comput. Sci. 700, 75\u201388 (2017). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2017.08.002","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"18_CR12","doi-asserted-by":"publisher","first-page":"245","DOI":"10.3233\/FI-2018-1741","volume":"163","author":"A Ganguly","year":"2018","unstructured":"Ganguly, A., Patil, M., Shah, R., Thankachan, S.V.: A linear space data structure for range LCP queries. Fundam. Inform. 163(3), 245\u2013251 (2018). \n                      https:\/\/doi.org\/10.3233\/FI-2018-1741","journal-title":"Fundam. Inform."},{"issue":"2","key":"18_CR13","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13(2), 338\u2013355 (1984). \n                      https:\/\/doi.org\/10.1137\/0213024","journal-title":"SIAM J. Comput."},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1186\/1471-2105-6-123","volume":"6","author":"B Haubold","year":"2005","unstructured":"Haubold, B., Pierstorff, N., M\u00f6ller, F., Wiehe, T.: Genome comparison without alignment using shortest unique substrings. BMC Bioinform. 6, 123 (2005). \n                      https:\/\/doi.org\/10.1186\/1471-2105-6-123","journal-title":"BMC Bioinform."},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2017.05.032","volume":"690","author":"W Hon","year":"2017","unstructured":"Hon, W., Thankachan, S.V., Xu, B.: In-place algorithms for exact and approximate shortest unique substring problems. Theor. Comput. Sci. 690, 12\u201325 (2017). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2017.05.032","journal-title":"Theor. Comput. Sci."},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-319-07566-2_18","volume-title":"Combinatorial Pattern Matching","author":"AM \u0130leri","year":"2014","unstructured":"\u0130leri, A.M., K\u00fclekci, M.O., Xu, B.: Shortest unique substring query revisited. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds.) CPM 2014. LNCS, vol. 8486, pp. 172\u2013181. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-07566-2_18"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-00479-8_16","volume-title":"String Processing and Information Retrieval","author":"CS Iliopoulos","year":"2018","unstructured":"Iliopoulos, C.S., Mohamed, M., Pissis, S.P., Vayani, F.: Maximal motif discovery in a sliding window. In: Gagie, T., Moffat, A., Navarro, G., Cuadros-Vargas, E. (eds.) SPIRE 2018. LNCS, vol. 11147, pp. 191\u2013205. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-030-00479-8_16"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jda.2018.11.009","volume":"52","author":"H Inoue","year":"2018","unstructured":"Inoue, H., Nakashima, Y., Mieno, T., Inenaga, S., Bannai, H., Takeda, M.: Algorithms and combinatorial properties on shortest unique palindromic substrings. J. Discrete Algorithms 52, 122\u2013132 (2018). \n                      https:\/\/doi.org\/10.1016\/j.jda.2018.11.009","journal-title":"J. Discrete Algorithms"},{"doi-asserted-by":"publisher","unstructured":"Khmelev, D.V., Teahan, W.J.: A repetition based measure for verification of text collections and for text categorization. In: Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2003, pp. 104\u2013110. ACM, New York (2003). \n                      https:\/\/doi.org\/10.1145\/860435.860456","key":"18_CR19","DOI":"10.1145\/860435.860456"},{"doi-asserted-by":"publisher","unstructured":"Mieno, T., Inenaga, S., Bannai, H., Takeda, M.: Shortest unique substring queries on run-length encoded strings. In: Faliszewski, P., Muscholl, A., Niedermeier, R. (eds.) 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, Krak\u00f3w, Poland, 22\u201326 August 2016. LIPIcs, vol. 58, pp. 69:1\u201369:11. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016). \n                      https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2016.69","key":"18_CR20","DOI":"10.4230\/LIPIcs.MFCS.2016.69"},{"unstructured":"Mieno, T., K\u00f6ppl, D., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Compact data structures for shortest unique substring queries. CoRR abs\/1905.12854 (2019), \n                      http:\/\/arxiv.org\/abs\/1905.12854","key":"18_CR21"},{"unstructured":"Pei, J., Wu, W.C.H., Yeh, M.Y.: On shortest unique substring queries. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 937\u2013948. IEEE (2013)","key":"18_CR22"},{"issue":"22","key":"18_CR23","doi-asserted-by":"publisher","first-page":"4633","DOI":"10.1093\/nar\/29.22.4633","volume":"29","author":"C Schleiermacher","year":"2001","unstructured":"Schleiermacher, C., Ohlebusch, E., Stoye, J., Choudhuri, J.V., Giegerich, R., Kurtz, S.: REPuter: the manifold applications of repeat analysis on a genomic scale. Nucleic Acids Res. 29(22), 4633\u20134642 (2001). \n                      https:\/\/doi.org\/10.1093\/nar\/29.22.4633","journal-title":"Nucleic Acids Res."},{"doi-asserted-by":"publisher","unstructured":"Schultz, D.W., Xu, B.: On k-mismatch shortest unique substring queries using GPU. In: Proceedings of Bioinformatics Research and Applications - 14th International Symposium, ISBRA 2018, Beijing, China, 8\u201311 June 2018, pp. 193\u2013204 (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-94968-0_18","key":"18_CR24","DOI":"10.1007\/978-3-319-94968-0_18"},{"doi-asserted-by":"publisher","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. In: Proceedings of the 13th Annual ACM Symposium on Theory of Computing, Milwaukee, Wisconsin, USA, 11\u201313 May 1981, pp. 114\u2013122 (1981). \n                      https:\/\/doi.org\/10.1145\/800076.802464","key":"18_CR25","DOI":"10.1145\/800076.802464"},{"doi-asserted-by":"publisher","unstructured":"Thankachan, S.V., Aluru, C., Chockalingam, S.P., Aluru, S.: Algorithmic framework for approximate matching under bounded edits with applications to sequence analysis. In: Proceedings of Research in Computational Molecular Biology - 22nd Annual International Conference, RECOMB 2018, Paris, France, 21\u201324 April 2018, pp. 211\u2013224 (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-89929-9_14","key":"18_CR26","DOI":"10.1007\/978-3-319-89929-9_14"},{"key":"18_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-319-04298-5_44","volume-title":"SOFSEM 2014: Theory and Practice of Computer Science","author":"K Tsuruta","year":"2014","unstructured":"Tsuruta, K., Inenaga, S., Bannai, H., Takeda, M.: Shortest unique substrings queries in optimal time. In: Geffert, V., Preneel, B., Rovan, B., \u0160tuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol. 8327, pp. 503\u2013513. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-04298-5_44"},{"doi-asserted-by":"publisher","unstructured":"Watanabe, K., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Shortest unique palindromic substring queries on run-length encoded strings. In: Proceedings of Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, 23\u201325 July 2019, pp. 430\u2013441 (2019). \n                      https:\/\/doi.org\/10.1007\/978-3-030-25005-8_35","key":"18_CR28","DOI":"10.1007\/978-3-030-25005-8_35"},{"doi-asserted-by":"publisher","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proceedings of the 14th Annual Symposium on Switching and Automata Theory (SWAT 1973), pp. 1\u201311. IEEE Computer Society, Washington, DC (1973). \n                      https:\/\/doi.org\/10.1109\/SWAT.1973.13","key":"18_CR29","DOI":"10.1109\/SWAT.1973.13"},{"doi-asserted-by":"publisher","unstructured":"Yao, A.C.: Space-time tradeoff for answering range queries (extended abstract). In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, STOC 1982, pp. 128\u2013136. ACM, New York (1982). \n                      https:\/\/doi.org\/10.1145\/800070.802185","key":"18_CR30","DOI":"10.1145\/800070.802185"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-32686-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T21:07:06Z","timestamp":1570223226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-32686-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030326852","9783030326869"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32686-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Segovia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/spire19.lbd.org.es\/","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":"59","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":"8","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":"47% - 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":"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":"1","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}