{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:14Z","timestamp":1725488954004},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_57","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"645-656","source":"Crossref","is-referenced-by-count":6,"title":["Finding Patterns in Given Intervals"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]},{"given":"M. Sohel","family":"Rahman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"57_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-45749-6_6","volume-title":"Algorithms - ESA 2002","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Govindarajan, S., Muthukrishnan, S.: Range searching in categorical data: Colored range searching on grid. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 17\u201328. Springer, Heidelberg (2002)"},{"key":"57_CR2","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1145\/1109557.1109692","volume-title":"SODA","author":"A. Amir","year":"2006","unstructured":"Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: rearrangement distances. In: SODA, pp. 1221\u20131229. ACM Press, New York (2006)"},{"issue":"1-2","key":"57_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.tcs.2003.10.039","volume":"314","author":"A. Amir","year":"2004","unstructured":"Amir, A., Butman, A., Crochemore, M., Landau, G.M., Schaps, M.: Two-dimensional pattern matching with rotations. Theor. Comput. Sci.\u00a0314(1-2), 173\u2013187 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"57_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0020-0190(99)00060-5","volume":"70","author":"A. Amir","year":"1999","unstructured":"Amir, A., Butman, A., Lewenstein, M.: Real scaled matching. Inf. Process. Lett.\u00a070(4), 185\u2013190 (1999)","journal-title":"Inf. Process. Lett."},{"key":"57_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/11780441_19","volume-title":"Combinatorial Pattern Matching","author":"A. Amir","year":"2006","unstructured":"Amir, A., Chencinski, E.: Faster two dimensional scaled matching. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 200\u2013210. Springer, Heidelberg (2006)"},{"key":"57_CR6","doi-asserted-by":"crossref","unstructured":"Amir, A., Chencinski, E., Iliopoulos, C., Kopelowitz, T., Zhang, H.: Property matching and weighted matching. In: CPM, pp. 1\u201315 (2006)","DOI":"10.1007\/11780441_18"},{"key":"57_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/978-3-540-27801-6_31","volume-title":"Combinatorial Pattern Matching","author":"A. Amir","year":"2004","unstructured":"Amir, A., Kapah, O., Tsur, D.: Faster two dimensional pattern matching with rotations. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 409\u2013419. Springer, Heidelberg (2004)"},{"key":"57_CR8","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M.: The lca problem revisited. In: Latin American Theoretical INformatics (LATIN), pp. 88\u201394 (2000)","DOI":"10.1007\/10719839_9"},{"issue":"6","key":"57_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.ipl.2004.09.002","volume":"92","author":"A. Butman","year":"2004","unstructured":"Butman, A., Eres, R., Landau, G.M.: Scaled and permuted string matching. Inf. Process. Lett.\u00a092(6), 293\u2013297 (2004)","journal-title":"Inf. Process. Lett."},{"key":"57_CR10","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/1007352.1007374","volume-title":"STOC","author":"R. Cole","year":"2004","unstructured":"Cole, R., Gottlieb, L.-A., Lewenstein, M.: Dictionary matching and indexing with errors and don\u2019t cares. In: Babai, L. (ed.) STOC, pp. 91\u2013100. ACM Press, New York (2004)"},{"key":"57_CR11","doi-asserted-by":"crossref","unstructured":"Cole, R., Hariharan, R.: Verifying candidate matches in sparse and wildcard matching. In: STOC, pp. 592\u2013601 (2002)","DOI":"10.1145\/509907.509992"},{"key":"57_CR12","doi-asserted-by":"crossref","DOI":"10.1142\/4838","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)"},{"key":"57_CR13","doi-asserted-by":"crossref","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: FOCS, pp. 137\u2013143 (1997)","DOI":"10.1109\/SFCS.1997.646102"},{"key":"57_CR14","unstructured":"Fischer, M., Paterson, M.: String matching and other products. In: Karp, R.M. (ed.) Complexity of Computation. SIAM AMS Proceedings, vol.\u00a07, pp. 113\u2013125 (1974)"},{"key":"57_CR15","doi-asserted-by":"crossref","unstructured":"Gabow, H., Bentley, J., Tarjan, R.: Scaling and related techniques for geometry problems. In: Symposium on the Theory of Computing (STOC), pp. 135\u2013143 (1984)","DOI":"10.1145\/800057.808675"},{"key":"57_CR16","doi-asserted-by":"crossref","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)"},{"issue":"4","key":"57_CR17","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1145\/322033.322044","volume":"24","author":"D.S. Hirschberg","year":"1977","unstructured":"Hirschberg, D.S.: Algorithms for the longest common subsequence problem. J. ACM\u00a024(4), 664\u2013675 (1977)","journal-title":"J. ACM"},{"key":"57_CR18","unstructured":"Jurka, J.: Human repetitive elements. In: Meyers, R.A. (ed.) Molecular Biology and Biotechnology"},{"key":"57_CR19","unstructured":"Jurka, J.: Origin and evolution of alu repetitive elements. In: Maraia, R. (ed.) The impact of short interspersed elements (SINEs) on the host genome"},{"key":"57_CR20","first-page":"707","volume":"10","author":"V. Levenshtein","year":"1966","unstructured":"Levenshtein, V.: Binary codes capable of correcting, deletions, insertions and reversals. Soviet Phys. Dokl.\u00a010, 707\u2013710 (1966)","journal-title":"Soviet Phys. Dokl."},{"key":"57_CR21","doi-asserted-by":"crossref","unstructured":"M\u00e4kinen, V., Navarro, G.: Position-restricted substring searching. In: LATIN, pp. 1\u201312 (2006)","DOI":"10.1007\/11682462_64"},{"issue":"2","key":"57_CR22","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. J. ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"J. ACM"},{"key":"57_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/11809678_17","volume-title":"Computing and Combinatorics","author":"M.S. Rahman","year":"2006","unstructured":"Rahman, M.S., Iliopoulos, C., Lee, I., Mohamed, M., Smyth, W.: Finding patterns with variable length gaps or don\u2019t cares. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol.\u00a04112, pp. 146\u2013155. Springer, Heidelberg (2006)"},{"issue":"1","key":"57_CR24","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.jda.2006.03.011","volume":"5","author":"K. Sadakane","year":"2007","unstructured":"Sadakane, K.: Succinct data structures for flexible text retrieval systems. Journal of Discrete Algorithms\u00a05(1), 12\u201322 (2007)","journal-title":"Journal of Discrete Algorithms"},{"issue":"3","key":"57_CR25","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica\u00a014(3), 249\u2013260 (1995)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T19:41:37Z","timestamp":1684006897000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}