{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:13Z","timestamp":1725493453868},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540763352"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76336-9_15","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T05:44:48Z","timestamp":1193463888000},"page":"144-156","source":"Crossref","is-referenced-by-count":1,"title":["On the Suffix Automaton with Mismatches"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[]},{"given":"Chiara","family":"Epifanio","sequence":"additional","affiliation":[]},{"given":"Alessandra","family":"Gabriele","sequence":"additional","affiliation":[]},{"given":"Filippo","family":"Mignosi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A. Blumer","year":"1985","unstructured":"Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M., Seiferas, J.: The smallest automaton recognizing the subwords of a text. Theoretical Computer Science\u00a040, 31\u201355 (1985)","journal-title":"Theoretical Computer Science"},{"key":"15_CR2","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithmique du texte. Vuibert, pp. 347 (2001)"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0304-3975(99)00334-5","volume":"259","author":"A. Carpi","year":"2001","unstructured":"Carpi, A., de Luca, A.: Words and special factors. Theoretical Computer Science\u00a0259, 145\u2013182 (2001)","journal-title":"Theoretical Computer Science"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1006\/jagm.2000.1104","volume":"37","author":"A. Amir","year":"2000","unstructured":"Amir, A., Keselman, D., Landau, G.M., Lewenstein, M., Lewenstein, N., Rodeh, M.: Indexing and dictionary matching with one error. Journal of Algorithms\u00a037, 309\u2013325 (2000)","journal-title":"Journal of Algorithms"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/3-540-45253-2_12","volume-title":"Algorithms - ESA 2000","author":"A.L. Buchsbaum","year":"2000","unstructured":"Buchsbaum, A.L., Goodrich, M.T., Westbrook, J.: Range searching over tree cross products. In: Paterson, M.S. (ed.) ESA 2000. LNCS, vol.\u00a01879, pp. 120\u2013131. Springer, Heidelberg (2000)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-45995-2_20","volume-title":"LATIN 2002: Theoretical Informatics","author":"E. Ch\u00e1vez","year":"2002","unstructured":"Ch\u00e1vez, E., Navarro, G.: A metric index for approximate string matching. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 181\u2013195. Springer, Heidelberg (2002)"},{"key":"15_CR7","volume-title":"STOC 2004","author":"R. Cole","year":"2004","unstructured":"Cole, R., Gottlieb, L., Lewenstein, M.: Dictionary matching and indexing with errors and don\u2019t cares. In: STOC 2004. Proceedings of Annual ACM Symposium on Theory of Computing, ACM Press, New York (2004)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/11505877_20","volume-title":"Developments in Language Theory","author":"C. Epifanio","year":"2005","unstructured":"Epifanio, C., Gabriele, A., Mignosi, F.: Languages with mismatches and an application to approximate indexing. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol.\u00a03572, pp. 224\u2013235. Springer, Heidelberg (2005)"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Epifanio, C., Gabriele, A., Mignosi, F., Restivo, A., Sciortino, M.: Languages with mismatches (Theoretical Computer Science) (to appear)","DOI":"10.1016\/j.tcs.2007.06.006"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/3-540-44849-7_20","volume-title":"Algorithms and Complexity","author":"A. Gabriele","year":"2003","unstructured":"Gabriele, A., Mignosi, F., Restivo, A., Sciortino, M.: Indexing structure for approximate string matching. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) CIAC 2003. LNCS, vol.\u00a02653, pp. 140\u2013151. Springer, Heidelberg (2003)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1007\/978-3-540-27801-6_33","volume-title":"Combinatorial Pattern Matching","author":"T.N.D. Huynh","year":"2004","unstructured":"Huynh, T.N.D., Hon, W.K., Lam, T.W., Sung, W.K.: Approximate string matching using compressed suffix arrays. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 434\u2013444. Springer, Heidelberg (2004)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/11496656_3","volume-title":"Combinatorial Pattern Matching","author":"M.G. Maass","year":"2005","unstructured":"Maass, M.G., Nowak, J.: Text indexing with errors. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 21\u201332. Springer, Heidelberg (2005)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Hancart, C.: Automata for Matching Patterns. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Linear Modeling: Background and Application, vol.\u00a02, pp. 399\u2013462. Springer, Heidelberg","DOI":"10.1007\/978-3-662-07675-0_9"},{"issue":"2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.dam.2004.04.012","volume":"146","author":"S. Inenaga","year":"2005","unstructured":"Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S., Mauri, G., Pavesi, G.: On-line construction of compact directed acyclic word graphs. Discrete Applied Mathematics\u00a0146(2), 156\u2013179 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)"},{"key":"15_CR16","series-title":"Encyclopedia of Mathematics","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. Encyclopedia of Mathematics, vol.\u00a017. Cambridge University Press, Cambridge (1983)"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Gabriele, A.: Combinatorics on words with mismatches, algorithms and data structures for approximate indexing with applications. PhD thesis, University of Palermo (2004)","DOI":"10.1007\/3-540-44849-7_20"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0304-3975(01)00222-5","volume":"292","author":"M. Crochemore","year":"2003","unstructured":"Crochemore, M.: Reducing space for index implementation. Theoretical Computer Science\u00a0292, 185\u2013197 (2003)","journal-title":"Theoretical Computer Science"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.ipl.2005.08.001","volume":"96","author":"M.G. Maass","year":"2005","unstructured":"Maass, M.G., Nowak, J.: A new method for approximate indexing and dictionary lookup with one error. Information Processing Letters\u00a096, 185\u2013191 (2005)","journal-title":"Information Processing Letters"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/3-540-48447-7_19","volume-title":"Algorithms and Data Structures","author":"A. Amir","year":"1999","unstructured":"Amir, A., Keselman, D., Landau, G.M., Lewenstein, M., Lewenstein, N., Rodeh, M.: Indexing and dictionary matching with one error. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol.\u00a01663, pp. 181\u2013192. Springer, Heidelberg (1999)"},{"key":"15_CR21","first-page":"19","volume":"24","author":"R. Baeza-Yates","year":"2001","unstructured":"Baeza-Yates, R., Navarro, G., Sutinen, E., Tarhio, J.: Indexing methods for approximate string matching. IEEE Data Engineering Bulletin\u00a024, 19\u201327 (2001) Special issue on Managing Text Natively and in DBMSs. Invited paper.","journal-title":"IEEE Data Engineering Bulletin"},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0885-064X(88)90008-8","volume":"24","author":"Z. Galil","year":"1988","unstructured":"Galil, Z., Giancarlo, R.: Data structures and algorithms for approximate string matching. Journal of Complexity\u00a024, 33\u201372 (1988)","journal-title":"Journal of Complexity"},{"key":"15_CR23","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Computing Surveys\u00a033, 31\u201388 (2001)","journal-title":"ACM Computing Surveys"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76336-9_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:48:05Z","timestamp":1619520485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76336-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540763352"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76336-9_15","relation":{},"subject":[]}}