{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:11:28Z","timestamp":1725567088162},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540265467"},{"type":"electronic","value":"9783540316824"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11505877_20","type":"book-chapter","created":{"date-parts":[[2010,9,26]],"date-time":"2010-09-26T13:40:25Z","timestamp":1285508425000},"page":"224-235","source":"Crossref","is-referenced-by-count":1,"title":["Languages with Mismatches and an Application to Approximate Indexing"],"prefix":"10.1007","author":[{"given":"Chiara","family":"Epifanio","sequence":"first","affiliation":[]},{"given":"Alessandra","family":"Gabriele","sequence":"additional","affiliation":[]},{"given":"Filippo","family":"Mignosi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1214\/aoap\/1177005208","volume":"4","author":"R. Arratia","year":"1989","unstructured":"Arratia, R., Waterman, M.: The Erd\u00f6s-R\u00e9nyi strong law for pattern matching with given proportion of mismatches. Annals of Probability\u00a04, 200\u2013225 (1989)","journal-title":"Annals of Probability"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Cole, R., Gottlieb, L., Lewenstein, M.: Dictionary matching and indexing with errors and don\u2019t cares. In: Proceedings of Annual ACM Symposium on Theory of Computing, STOC 2004 (2004)","DOI":"10.1145\/1007352.1007374"},{"key":"20_CR3","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithmique du texte. Vuibert, 347 pages (2001)"},{"key":"20_CR4","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":"20_CR5","unstructured":"Gabriele, A., Mignosi, F., Restivo, A., Sciortino, M.: Approximate string matching: indexing and the k-mismatch problem. Technical Report 244, University of Palermo, Department of Mathematics and Applications (2004)"},{"key":"20_CR6","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge, 534 pages. (1997), ISBN 0 521 58519 8 hardback"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"20_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002), ISBN 0-521-81220-8 hardback"},{"key":"20_CR9","unstructured":"Muthukrishnan, S.: Efficient algorithms for document retrieval problems. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 657\u2013666 (2002)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-44888-8_24","volume-title":"Combinatorial Pattern Matching","author":"J. Pelfr\u00eane","year":"2003","unstructured":"Pelfr\u00eane, J., Abdedda\u00efm, S., Alexandre, J.: Extracting approximate patterns. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 328\u2013347. Springer, Heidelberg (2003)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1007\/978-3-540-45138-9_56","volume-title":"Mathematical Foundations of Computer Science 2003","author":"N. Pisanti","year":"2003","unstructured":"Pisanti, N., Crochemore, M., Grossi, R., Sagot, M.-F.: A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 622\u2013631. Springer, Heidelberg (2003)"},{"key":"20_CR12","unstructured":"Pisanti, N., Crochemore, M., Grossi, R., Sagot, M.-F.: A comparative study of bases for motif inference. In: Iliopoulos, C., Lecroq, T. (eds.) String Algorithmics, King\u2019s College London Publications (2004)"},{"key":"20_CR13","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032770","volume-title":"Average Case Analysis of Algorithms on Sequences","author":"W. Szpankowski","year":"2001","unstructured":"Szpankowski, W.: Average Case Analysis of Algorithms on Sequences. John Wiley & Sons, Chichester (2001)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11505877_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T22:50:17Z","timestamp":1559688617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11505877_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540265467","9783540316824"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11505877_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}