{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:40:56Z","timestamp":1743136856087,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031721991"},{"type":"electronic","value":"9783031722004"}],"license":[{"start":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T00:00:00Z","timestamp":1726704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T00:00:00Z","timestamp":1726704000000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-72200-4_9","type":"book-chapter","created":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T19:01:50Z","timestamp":1726686110000},"page":"118-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounded-Ratio Gapped String Indexing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3331-0913","authenticated-orcid":false,"given":"Arnab","family":"Ganguly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1493-5432","authenticated-orcid":false,"given":"Daniel","family":"Gibney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-0351-6155","authenticated-orcid":false,"given":"Paul","family":"MacNichol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6852-1035","authenticated-orcid":false,"given":"Sharma V.","family":"Thankachan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Alstrup, S., Brodal, G.S., Rauhe, T.: Optimal static range reporting in one dimension. In: Vitter, J.S., Spirakis, P.G., Yannakakis, M. (eds.) Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 6-8 July 2001, Heraklion, Crete, Greece, pp. 476\u2013482. ACM (2001). https:\/\/doi.org\/10.1145\/380752.380842","DOI":"10.1145\/380752.380842"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Aronov, B., Cardinal, J., Dallant, J., Iacono, J.: A general technique for searching in implicit sets via function inversion. In: 2024 Symposium on Simplicity in Algorithms (SOSA), pp. 215\u2013223. SIAM (2024)","DOI":"10.1137\/1.9781611977936.20"},{"issue":"2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/S00453-012-9733-4","volume":"69","author":"P Bille","year":"2014","unstructured":"Bille, P., G\u00f8rtz, I.L.: Substring range reporting. Algorithmica 69(2), 384\u2013396 (2014). https:\/\/doi.org\/10.1007\/S00453-012-9733-4","journal-title":"Algorithmica"},{"key":"9_CR4","unstructured":"Bille, P., G\u00f8rtz, I.L., Lewenstein, M., Pissis, S.P., Rotenberg, E., Steiner, T.A.: Gapped string indexing in subquadratic space and sublinear query time. CoRR abs\/ arXiv: 2211.16860 (2022)"},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/S00453-022-01051-6","volume":"85","author":"P Bille","year":"2023","unstructured":"Bille, P., G\u00f8rtz, I.L., Pedersen, M.R., Steiner, T.A.: Gapped indexing for consecutive occurrences. Algorithmica 85(4), 879\u2013901 (2023). https:\/\/doi.org\/10.1007\/S00453-022-01051-6","journal-title":"Algorithmica"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/J.TCS.2012.03.029","volume":"443","author":"P Bille","year":"2012","unstructured":"Bille, P., G\u00f8rtz, I.L., Vildh\u00f8j, H.W., Wind, D.K.: String matching with variable length gaps. Theor. Comput. Sci. 443, 25\u201334 (2012). https:\/\/doi.org\/10.1016\/J.TCS.2012.03.029","journal-title":"Theor. Comput. Sci."},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Bille, P., Thorup, M.: Regular expression matching with multi-strings and intervals. In: Charikar, M. (ed.) Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, 17-19 January 2010, pp. 1297\u20131308. SIAM (2010). https:\/\/doi.org\/10.1137\/1.9781611973075.104","DOI":"10.1137\/1.9781611973075.104"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Cole, R., Gottlieb, L., Lewenstein, M.: Dictionary matching and indexing with errors and don\u2019t cares. In: Babai, L. (ed.) Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, 13-16 June 2004, pp. 91\u2013100. ACM (2004). https:\/\/doi.org\/10.1145\/1007352.1007374","DOI":"10.1145\/1007352.1007374"},{"key":"9_CR9","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-22 October 1997, pp. 137\u2013143. IEEE Computer Society (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646102","DOI":"10.1109\/SFCS.1997.646102"},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/S10791-008-9054-Z","volume":"11","author":"K Fredriksson","year":"2008","unstructured":"Fredriksson, K., Grabowski, S.: Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance. Inf. Retr. 11(4), 335\u2013357 (2008). https:\/\/doi.org\/10.1007\/S10791-008-9054-Z","journal-title":"Inf. Retr."},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Goldstein, I., Kopelowitz, T., Lewenstein, M., Porat, E.: Conditional lower bounds for space\/time tradeoffs. In: Ellen, F., Kolokolova, A., Sack, J. (eds.) WADS 2017, LNCS, vol. 10389, pp. 421\u2013436. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_36","DOI":"10.1007\/978-3-319-62127-2_36"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/S00453-007-9141-3","volume":"55","author":"CS Iliopoulos","year":"2009","unstructured":"Iliopoulos, C.S., Rahman, M.S.: Indexing factors with gaps. Algorithmica 55(1), 60\u201370 (2009). https:\/\/doi.org\/10.1007\/S00453-007-9141-3","journal-title":"Algorithmica"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Karpinski, M., Nekrich, Y.: Space efficient multi-dimensional range reporting. In: Ngo, H.Q. (ed COCOON 2009. LNCS, vol.\u00a05609, pp. 215\u2013224. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-02882-3_22","DOI":"10.1007\/978-3-642-02882-3_22"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Lewenstein, M.: Indexing with gaps. In: Grossi, R., Sebastiani, F., Silvestri, F. (eds.) SPIRE 2011. LNCS, vol.\u00a07024, pp. 135\u2013143. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-24583-1_14","DOI":"10.1007\/978-3-642-24583-1_14"},{"issue":"8","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1089\/CMB.2005.12.1065","volume":"12","author":"M Morgante","year":"2005","unstructured":"Morgante, M., Policriti, A., Vitacolonna, N., Zuccolo, A.: Structured motifs search. J. Comput. Biol. 12(8), 1065\u20131082 (2005). https:\/\/doi.org\/10.1089\/CMB.2005.12.1065","journal-title":"J. Comput. Biol."},{"issue":"6","key":"9_CR16","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1089\/106652703322756140","volume":"10","author":"G Navarro","year":"2003","unstructured":"Navarro, G., Raffinot, M.: Fast and simple character classes and bounded gaps pattern matching, with applications to protein searching. J. Comput. Biol. 10(6), 903\u2013923 (2003). https:\/\/doi.org\/10.1089\/106652703322756140","journal-title":"J. Comput. Biol."},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1142\/S0129054108005541","volume":"19","author":"P Peterlongo","year":"2008","unstructured":"Peterlongo, P., Allali, J., Sagot, M.: Indexing gapped-factors using a tree. Int. J. Found. Comput. Sci. 19(1), 71\u201387 (2008). https:\/\/doi.org\/10.1142\/S0129054108005541","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: 14th Annual Symposium on Switching and Automata Theory, Iowa City, Iowa, USA, 15-17 October 1973. pp. 1\u201311. IEEE Computer Society (1973). https:\/\/doi.org\/10.1109\/SWAT.1973.13","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-72200-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T19:02:27Z","timestamp":1726686147000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-72200-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,19]]},"ISBN":["9783031721991","9783031722004"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-72200-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,9,19]]},"assertion":[{"value":"19 September 2024","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":"Puerto Vallarta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","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":"23 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2024","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":"spire2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/computo.fismat.umich.mx\/spire2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}