{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:21Z","timestamp":1759638981625,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":17,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_188","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:36:15Z","timestamp":1214505375000},"page":"408-411","source":"Crossref","is-referenced-by-count":2,"title":["Indexed Approximate String Matching"],"prefix":"10.1007","author":[{"given":"Wing-Kin","family":"Sung","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"188_CR1_188","doi-asserted-by":"crossref","unstructured":"Amir, A., Keselman, D., Landau, G.M., Lewenstein, M., Lewenstein, N., Rodeh, M.: Indexing and dictionary matching with one error. In: Proceedings of Workshop on Algorithms and Data Structures, 1999, pp. 181\u2013192","DOI":"10.1007\/3-540-48447-7_19"},{"key":"188_CR2_188","doi-asserted-by":"crossref","unstructured":"Buchsbaum, A.L., Goodrich, M.T., Westbrook, J.R.: Range searching over tree cross products. In: Proceedings of European Symposium on Algorithms, 2000, pp. 120\u2013131","DOI":"10.1007\/3-540-45253-2_12"},{"key":"188_CR3_188","doi-asserted-by":"crossref","unstructured":"Chan, H.-L., Lam, T.-W., Sung, W.-K., Tam, S.-L., Wong, S.-S.: A\u00a0linear size index for approximate pattern matching. In: Proceedings of Symposium on Combinatorial Pattern Matching, 2006, pp. 49\u201359","DOI":"10.1007\/11780441_6"},{"key":"188_CR4_188","doi-asserted-by":"crossref","unstructured":"Chan, H.-L., Lam, T.-W., Sung, W.-K., Tam, S.-L., Wong, S.-S.: Compressed indexes for approximate string matching. In: Proceedings of European Symposium on Algorithms, 2006, pp.\u00a0208\u2013219","DOI":"10.1007\/11841036_21"},{"issue":"1\u20133","key":"188_CR5_188","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.tcs.2005.11.037","volume":"352","author":"G. Navarro","year":"2006","unstructured":"Navarro, G., Ch\u00e1vez, E.: A\u00a0metric index for approximate string matching. Theor. Comput. Sci. 352(1\u20133), 266\u2013279 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"188_CR6_188","doi-asserted-by":"crossref","unstructured":"Cobbs, A.: Fast approximate matching using suffix trees. In: Proceedings of Symposium on Combinatorial Pattern Matching, 1995, pp. 41\u201354","DOI":"10.1007\/3-540-60044-2_33"},{"key":"188_CR7_188","doi-asserted-by":"crossref","unstructured":"Coelho, L.P., Oliveira, A.L.: Dotted suffix trees: a\u00a0structure for approximate text indexing. In: SPIRE, 2006, pp. 329\u2013336","DOI":"10.1007\/11880561_27"},{"key":"188_CR8_188","doi-asserted-by":"crossref","unstructured":"Cole, R., Gottlieb, L.A., Lewenstein, M.: Dictionary matching and indexing with errors and don't cares. In: Proceedings of Symposium on Theory of Computing, 2004, pp. 91\u2013100","DOI":"10.1145\/1007352.1007374"},{"key":"188_CR9_188","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proceedings of Symposium on Foundations of Computer Science, 2000, pp. 390\u2013398"},{"key":"188_CR10_188","doi-asserted-by":"crossref","unstructured":"Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In: Proceedings of Symposium on Theory of Computing, 2000, pp.\u00a0397\u2013406","DOI":"10.1145\/335305.335351"},{"key":"188_CR11_188","doi-asserted-by":"crossref","unstructured":"Huynh, T.N.D., Hon, W.K., Lam, T.W., Sung, W.K.: Approximate string matching using compressed suffix arrays. In: Proceedings of Symposium on Combinatorial Pattern Matching, 2004, pp. 434\u2013444","DOI":"10.1007\/978-3-540-27801-6_33"},{"key":"188_CR12_188","doi-asserted-by":"crossref","unstructured":"Lam, T.W., Sung, W.K., Wong, S.S.: Improved approximate string matching using compressed suffix data structures. In: Proceedings of International Symposium on Algorithms and Computation, 2005, pp. 339\u2013348","DOI":"10.1007\/11602613_35"},{"key":"188_CR13_188","doi-asserted-by":"crossref","unstructured":"Maa\u00df, M.G., Nowak, J.: Text indexing with errors. In: Proceedings of Symposium on Combinatorial Pattern Matching, 2005, pp. 21\u201332","DOI":"10.1007\/11496656_3"},{"key":"188_CR14_188","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF01185432","volume":"12","author":"E.G. Myers","year":"1994","unstructured":"Myers, E.G.: A\u00a0sublinear algorithm for approximate keyword searching. Algorithmica 12, 345\u2013374 (1994)","journal-title":"Algorithmica"},{"issue":"1","key":"188_CR15_188","first-page":"205","volume":"1","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., Baeza-Yates R.: A\u00a0hybrid indexing method for approximate string matching. J.\u00a0Discret. Algorithms 1(1), 205\u2013209 (2000)","journal-title":"J. Discret. Algorithms"},{"issue":"4","key":"188_CR16_188","first-page":"19","volume":"24","author":"G. Navarro","year":"2001","unstructured":"Navarro, G., Baeza-Yates, R.A., Sutinen, E., Tarhio, J.: Indexing methods for approximate string matching. IEEE Data Eng. Bull. 24(4), 19\u201327 (2001)","journal-title":"IEEE Data Eng. Bull."},{"key":"188_CR17_188","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/SWAT.1973.13","volume-title":"Proc. of the 14th Annual IEEE Symposium on Switching and Automata Theory","author":"P. Weiner","year":"1973","unstructured":"Weiner., P.: Linear Pattern Matching Algorithms. In: Proceedings of Symposium on Switching and Automata Theory, 1973, pp.\u00a01\u201311"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_188","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T02:20:32Z","timestamp":1662171632000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_188"}},"subtitle":["2006; Chan, Lam, Sung, Tam, Wong"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_188","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}