{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:12Z","timestamp":1725544032134},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540345978"},{"type":"electronic","value":"9783540345985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11764298_15","type":"book-chapter","created":{"date-parts":[[2006,5,19]],"date-time":"2006-05-19T04:37:56Z","timestamp":1148013476000},"page":"170-181","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Bit-Parallel Algorithms for (\u03b4,\u03b1)-Matching"],"prefix":"10.1007","author":[{"given":"Kimmo","family":"Fredriksson","sequence":"first","affiliation":[]},{"given":"Szymon","family":"Grabowski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"10","key":"15_CR1","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R.A. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R.A., Gonnet, G.H.: A new approach to text searching. Communications of the ACM\u00a035(10), 74\u201382 (1992)","journal-title":"Communications of the ACM"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/11427186_37","volume-title":"Experimental and Efficient Algorithms","author":"D. Cantone","year":"2005","unstructured":"Cantone, D., Cristofaro, S., Faro, S.: An efficient algorithm for \u03b4-approximate matching with \u03b1-bounded gaps in musical sequences. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 428\u2013439. Springer, Heidelberg (2005)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Cantone, D., Cristofaro, S., Faro, S.: On tuning the (\u03b4,\u03b1)-sequential-sampling algorithm for \u03b4-approximate matching with \u03b1-bounded gaps in musical sequences. In: Proceedings of ISMIR 20005 (2005)","DOI":"10.1007\/11427186_37"},{"issue":"1","key":"15_CR4","first-page":"54","volume":"9","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Iliopoulos, C., Makris, C., Rytter, W., Tsakalidis, A., Tsichlas, K.: Approximate string matching with gaps. Nordic Journal of Computing\u00a09(1), 54\u201365 (2002)","journal-title":"Nordic Journal of Computing"},{"issue":"2\u20134","key":"15_CR5","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.jda.2004.08.005","volume":"3","author":"M. Crochemore","year":"2005","unstructured":"Crochemore, M., Iliopoulos, C., Navarro, G., Pinzon, Y., Salinger, A.: Bit-parallel (\u03b4,\u03b3)-matching suffix automata. Journal of Discrete Algorithms (JDA)\u00a03(2\u20134), 198\u2013214 (2005)","journal-title":"Journal of Discrete Algorithms (JDA)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"M\u00e4kinen, V.: Parameterized approximate string matching and local-similarity-based point-pattern matching. PhD thesis, Department of Computer Science, University of Helsinki (August 2003)","DOI":"10.1007\/3-540-45452-7_11"},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.jalgor.2004.07.008","volume":"56","author":"V. M\u00e4kinen","year":"2005","unstructured":"M\u00e4kinen, V., Navarro, G., Ukkonen, E.: Transposition invariant string matching. Journal of Algorithms\u00a056(2), 124\u2013153 (2005)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1089\/cmb.1996.3.33","volume":"3","author":"E.W. Myers","year":"1996","unstructured":"Myers, E.W.: Approximate matching of network expression with spacers. Journal of Computational Biology\u00a03(1), 33\u201351 (1996)","journal-title":"Journal of Computational Biology"},{"issue":"6","key":"15_CR9","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1089\/106652703322756140","volume":"10","author":"G. Navarro","year":"2003","unstructured":"Navarro, G., Raffinot, M.: Fast and simple character classes and bounded gaps pattern matching, with applications to protein searching. Journal of Computational Biology\u00a010(6), 903\u2013923 (2003)","journal-title":"Journal of Computational Biology"},{"key":"15_CR10","unstructured":"Pinz\u00f3n, Y.J., Wang, S.: Simple algorithm for pattern-matching with bounded gaps in genomic sequences. In: Proceedings of ICNAAM 2005, pp. 827\u2013831 (2005)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11764298_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:10:50Z","timestamp":1619493050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11764298_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540345978","9783540345985"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11764298_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}