{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:09:27Z","timestamp":1725750567456},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319024318"},{"type":"electronic","value":"9783319024325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-02432-5_7","type":"book-chapter","created":{"date-parts":[[2013,9,29]],"date-time":"2013-09-29T20:51:58Z","timestamp":1380487918000},"page":"29-36","source":"Crossref","is-referenced-by-count":1,"title":["Position-Restricted Substring Searching over Small Alphabets"],"prefix":"10.1007","author":[{"given":"Sudip","family":"Biswas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsung-Han","family":"Ku","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sharma V.","family":"Thankachan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.tcs.2008.01.006","volume":"395","author":"A. Amir","year":"2008","unstructured":"Amir, A., Chencinski, E., Iliopoulos, C.S., Kopelowitz, T., Zhang, H.: Property matching and weighted matching. Theoretical Computer Science\u00a0395, 298\u2013310 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1006\/inco.1995.1090","volume":"119","author":"A. Amir","year":"1995","unstructured":"Amir, A., Farach, M., Idury, R.M., La Poutr\u00e9, J.A., Sch\u00e4ffer, A.A.: Improved Dynamic Dictionary Matching. Information and Computation\u00a0119(2), 258\u2013282 (1995)","journal-title":"Information and Computation"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-21458-5_26","volume-title":"Combinatorial Pattern Matching","author":"P. Bille","year":"2011","unstructured":"Bille, P., G\u00f8rtz, I.L.: Substring Range Reporting. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 299\u2013308. Springer, Heidelberg (2011)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Larsen, K.G., Patrascu, M.: Orthogonal range searching on the RAM, revisited. In: SoCG, pp. 1\u201310 (2011)","DOI":"10.1145\/1998196.1998198"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Chien, Y.-F., Hon, W.K., Shah, R., Thankachan, S.V., Vitter, J.S.: Geometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching. Algorithmica, 1\u201321 (2013)","DOI":"10.1007\/s00453-013-9792-1"},{"key":"7_CR6","unstructured":"Crochemore, M., Iliopoulos, C.S., Kubica, M., Rahman, M.S., Walen, T.: Improved Algorithms for the Range Next Value Problem and Applications. In: STACS, pp. 205\u2013216 (2008)"},{"key":"7_CR7","unstructured":"Gagie, T., Gawrychowski, P.: Linear-Space Substring Range Counting over Polylogarithmic Alphabets. CoRR, arXiv: 1202.3208 (2012)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Golynski, A., Munro, J.I., Rao, S.S.: Rank\/Select Operations on Large Alphabets: A Tool for Text Indexing. In: SODA, pp. 368\u2013373 (2006)","DOI":"10.1145\/1109557.1109599"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Hon, W.K., Patil, M., Shah, R., Thankachan, S.V.: Compressed Property Suffix Tree. In: IEEE Data Compression Conference, pp. 123\u2013132 (2011)","DOI":"10.1109\/DCC.2011.19"},{"key":"#cr-split#-7_CR10.1","doi-asserted-by":"crossref","unstructured":"Hon, W.K., Shah, R., Thankachan, S.V., Vitter, J.S.: On position restricted substring searching in succinct space. Journal of Discrete Algorithms (2012)","DOI":"10.1016\/j.jda.2012.09.002"},{"key":"#cr-split#-7_CR10.2","doi-asserted-by":"crossref","unstructured":"Hon, W.-K., Ku, T.-H., Shah, R., Thankachan, S.V., Vitter, J.S.: Compressed text indexing with wildcards. In: Grossi, R., Sebastiani, F., Silvestri, F. (eds.) SPIRE 2011. LNCS, vol.\u00a07024, pp. 267-277. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-24583-1_26"},{"issue":"18","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/j.ipl.2009.06.009","volume":"109","author":"M.T. Juan","year":"2009","unstructured":"Juan, M.T., Liu, J.J., Wang, Y.L.: Errata for \u201cFaster index for property matching\u201d. Information Processing Letter\u00a0109(18), 1027\u20131029 (2009)","journal-title":"Information Processing Letter"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-642-13509-5_7","volume-title":"Combinatorial Pattern Matching","author":"T. Kopelowitz","year":"2010","unstructured":"Kopelowitz, T.: The Property Suffix Tree with Dynamic Properties. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol.\u00a06129, pp. 63\u201375. Springer, Heidelberg (2010)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-24583-1_8","volume-title":"String Processing and Information Retrieval","author":"T. Kopelowitz","year":"2011","unstructured":"Kopelowitz, T., Lewenstein, M., Porat, E.: Persistency in Suffix Trees with Applications to String Interval Problems. In: Grossi, R., Sebastiani, F., Silvestri, F. (eds.) SPIRE 2011. LNCS, vol.\u00a07024, pp. 67\u201380. Springer, Heidelberg (2011)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/11682462_64","volume-title":"LATIN 2006: Theoretical Informatics","author":"V. M\u00e4kinen","year":"2006","unstructured":"M\u00e4kinen, V., Navarro, G.: Position-Restricted Substring Searching. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 703\u2013714. Springer, Heidelberg (2006)"},{"issue":"5","key":"7_CR15","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix Arrays: A New Method for On-Line String Searches. SIAM Journal on Computing\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A Space-Economical Suffix Tree Construction Algorithm. Journal of the ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-31155-0_24","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"Y. Nekrich","year":"2012","unstructured":"Nekrich, Y., Navarro, G.: Sorted Range Reporting. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol.\u00a07357, pp. 271\u2013282. Springer, Heidelberg (2012)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear Pattern Matching Algorithms. In: SWAT (1973)","DOI":"10.1109\/SWAT.1973.13"}],"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-319-02432-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T12:29:15Z","timestamp":1558096155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-02432-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319024318","9783319024325"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02432-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}