{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:22:38Z","timestamp":1725524558418},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422716"},{"type":"electronic","value":"9783540481942"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48194-x_6","type":"book-chapter","created":{"date-parts":[[2009,2,3]],"date-time":"2009-02-03T14:24:31Z","timestamp":1233671071000},"page":"73-85","source":"Crossref","is-referenced-by-count":29,"title":["Better Filtering with Gapped q-Grams"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Burkhardt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juha","family":"K\u00e4rkk\u00e4inen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,13]]},"reference":[{"key":"6_CR1","unstructured":"R. Baeza-Yates and G. Gonnet. All-against-all sequence matching. Technical report, Dept. of Computer Science, University of Chile, 1990."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"S. Burkhardt, A. Crauser, P. Ferragina, H.-P. Lenhof, E. Rivals, and M. Vingron. q-gram based database searching using a suffix array. In S. Istrail, P. Pevzner, and M. Waterman, editors, Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), pages 77\u201383, Lyon, France, 1999. ACM Press.","DOI":"10.1145\/299432.299460"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"A. Califano and I. Rigoutsos. FLASH: A fast look-up algorithm for string homology. In L. Hunter, D. Searls, and J. Shavlik, editors, Proceedings of the First International Conference on Intelligent Systems for Molecular Biology, pages 56\u201364, Bethesda, MD, 1993. AAAI Press.","DOI":"10.1109\/CVPR.1993.341106"},{"key":"6_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-60044-2_33","volume-title":"Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching","author":"A.L. Cobbs","year":"1995","unstructured":"A.L. Cobbs. Fast approximate matching using suffix trees. In Z. Galil and E. Ukkonen, editors, Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching, number 937 in Lecture Notes in Computer Science, pages 41\u201354, Espoo, Finland, 1995. Springer-Verlag, Berlin."},{"key":"6_CR5","unstructured":"N. Holsti and E. Sutinen. Approximate string matching using q-gram places. In Proceedings of the 7th Finnish Symposium on Computer Science, pages 23\u201332, 1994."},{"key":"6_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/3-540-54345-7_67","volume-title":"Proceedings of the 16th Symposium on Mathematical Foundations of Computer Science","author":"P. Jokinen","year":"1991","unstructured":"P. Jokinen and E. Ukkonen. Two algorithms for approximate string matching in static texts. In A. Tarlecki, editor, Proceedings of the 16th Symposium on Mathematical Foundations of Computer Science, number 520 in Lecture Notes in Computer Science, pages 240\u2013248, Kazimierz Dolny, Poland, 1991. Springer-Verlag, Berlin."},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1093\/bioinformatics\/14.5.430","volume":"14","author":"A. Krause","year":"1998","unstructured":"A. Krause and M. Vingron. A set-theoretic approach to database searching and clustering. Bioinformatics, 14:430\u2013438, 1998.","journal-title":"Bioinformatics"},{"key":"6_CR8","unstructured":"O. Lehtinen, E. Sutinen, and J. Tarhio. Experiments on block indexing. In R. Baeza-Yates N. Ziviani and K. Guimar\u00e3es, editors, Proceedings of the 3rd South AmericanWorkshop on String Processing (WSP\u201996), pages 183\u2013193, Recife, Brazil, 1996. Carleton University Press."},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/316542.316550","volume":"46","author":"G. Myers","year":"1999","unstructured":"G. Myers. A fast bit-vector algorithm for approximate string matching based on dynamic programming. J. Assoc. Comput. Mach., 46(3):395\u2013415, 1999.","journal-title":"J. Assoc. Comput. Mach"},{"key":"6_CR10","unstructured":"G. Navarro. Approximate Text Searching. PhD thesis, Dept. of Computer Science, University of Chile, 1998."},{"issue":"1\/2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF01188584","volume":"13","author":"P.A. Pevzner","year":"1995","unstructured":"P.A. Pevzner and M.S. Waterman. Multiple filtration and approximate pattern matching. Algorithmica, 13(1\/2):135\u2013154, 1995.","journal-title":"Algorithmica"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"F.P. Preparata, A.M. Fieze, and E. Upfal. On the power of universal bases in sequencing by hybridization. In Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), pages 295\u2013301, Lyon, France, 1999. ACM Press.","DOI":"10.1145\/299432.299505"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"F.P. Preparata and E. Upfal. Sequencing-by-hybridization at the informationtheory bound: An optimal algorithm. In R. Shamir, S. Miyano, S. Istrail, P. Pevzner, and M. Waterman, editors, Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), pages 245\u2013253, Tokio, 2000. ACM Press.","DOI":"10.1145\/332306.332562"},{"key":"6_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/3-540-60313-1_153","volume-title":"Proceedings of the 3rd Annual European Symposium on Algorithms","author":"E. Sutinen","year":"1995","unstructured":"E. Sutinen and J. Tarhio. On using q-gram locations in approximate string matching. In P.G. Spirakis, editor, Proceedings of the 3rd Annual European Symposium on Algorithms, number 979 in Lecture Notes in Computer Science, pages 327\u2013340, Corfu, Greece, 1995. Springer-Verlag, Berlin."},{"key":"6_CR15","series-title":"Lect Notes Comput Sci","first-page":"236","volume-title":"Proceedings of the 5th International Symposium on Algorithms and Computation","author":"T. Takaoka","year":"1994","unstructured":"T. Takaoka. Approximate pattern matching with samples. In Ding-Zhu Du and Xiang sun Zhang, editors, Proceedings of the 5th International Symposium on Algorithms and Computation, number 834 in Lecture Notes in Computer Science, pages 236\u2013242, Beijing, P.R. China, 1994. Springer-Verlag, Berlin."},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"92","author":"E. Ukkonen","year":"1992","unstructured":"E. Ukkonen. Approximate string matching with q-grams and maximal matches. Theor. Comput. Sci., 92(1):191\u2013212, 1992.","journal-title":"Theor. Comput. Sci"},{"key":"6_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/BFb0029808","volume-title":"Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching","author":"E. Ukkonen","year":"1993","unstructured":"E. Ukkonen. Approximate string matching over suffix trees. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching, number 684 in Lecture Notes in Computer Science, pages 228\u2013242, Padova, Italy, 1993. Springer-Verlag, Berlin."},{"key":"6_CR18","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1101\/gr.7.5.401","volume":"7","author":"J. Weber","year":"1997","unstructured":"J. Weber and H. Myers. Human whole genome shotgun sequencing. Genome Research, 7:401\u2013409, 1997.","journal-title":"Genome Research"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48194-X_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T15:41:05Z","timestamp":1558107665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48194-X_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422716","9783540481942"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48194-x_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]}}}