{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:58:30Z","timestamp":1725559110492},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540258667"},{"type":"electronic","value":"9783540319504"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11415770_15","type":"book-chapter","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T23:44:50Z","timestamp":1278978290000},"page":"189-203","source":"Crossref","is-referenced-by-count":9,"title":["Efficient q-Gram Filters for Finding All \u03b5-Matches over a Given Length"],"prefix":"10.1007","author":[{"given":"Kim R.","family":"Rasmussen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugene W.","family":"Myers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S.F. Altschul","year":"1990","unstructured":"Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. J. Mol. Biol.\u00a0215(3), 403\u2013410 (1990)","journal-title":"J. Mol. Biol."},{"issue":"17","key":"15_CR2","doi-asserted-by":"publisher","first-page":"3389","DOI":"10.1093\/nar\/25.17.3389","volume":"25","author":"S.F. Altschul","year":"1997","unstructured":"Altschul, S.F., Madden, T.L., Sch\u00e4ffer, A.A., Zhang, J., Zhang, Z., Miller, W., Lipman, D.J.: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res.\u00a025(17), 3389\u20133402 (1997)","journal-title":"Nucleic Acids Res."},{"doi-asserted-by":"crossref","unstructured":"Burkhardt, S., Crauser, A., Ferragina, P., Lenhof, H.-P., Rivals, E., Vingron, M.: q-gram based database searching using a suffix array. In: Proc. of the 3rd Annu. Int. Conf. on Computational Molecular Biology (RECOMB 1999), pp. 77\u201383 (1999)","key":"15_CR3","DOI":"10.1145\/299432.299460"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-48194-X_6","volume-title":"Combinatorial Pattern Matching","author":"S. Burkhardt","year":"2001","unstructured":"Burkhardt, S., K\u00e4rkk\u00e4inen, J.: Better filtering with gapped q-grams. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 73\u201385. Springer, Heidelberg (2001)"},{"unstructured":"Califano, A., Rigoutsos, I.: FLASH: a fast look-up algorithm for string homology. In: Proc. of the 1st Int. Conf. on Intelligent Systems for Molecular Biology (ISMB 1993), pp. 56\u201364 (1993)","key":"15_CR5"},{"issue":"4\/5","key":"15_CR6","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF01185431","volume":"12","author":"W.I. Chang","year":"1994","unstructured":"Chang, W.I., Lawler, E.L.: Sublinear expected time approximate string matching and biological applications. Algorithmica\u00a012(4\/5), 327\u2013344 (1994)","journal-title":"Algorithmica"},{"issue":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1145\/146637.146650","volume":"39","author":"D. Eppstein","year":"1992","unstructured":"Eppstein, D., Galil, Z., Giancarlo, R., Italiano, G.F.: Sparse dynamic programming I: linear cost functions. J. ACM\u00a039(3), 519\u2013545 (1992)","journal-title":"J. ACM"},{"key":"15_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/3-540-54345-7_67","volume-title":"Mathematical Foundations of Computer Science 1991","author":"P. Jokinen","year":"1991","unstructured":"Jokinen, P., Ukkonen, E.: Two algorithms for approximate string matching in static texts. In: Tarlecki, A. (ed.) MFCS 1991. LNCS, vol.\u00a0520, pp. 240\u2013248. Springer, Heidelberg (1991)"},{"issue":"4","key":"15_CR10","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1101\/gr.229202","volume":"12","author":"W.J. Kent","year":"2002","unstructured":"Kent, W.J.: BLAT \u2013 the BLAST-like alignment tool. Genome Res.\u00a012(4), 656\u2013664 (2002)","journal-title":"Genome Res."},{"unstructured":"Li, M., Ma, B., Kisman, D., Tromp, J.: PatternHunter II: Highly Sensitive and Fast Homology Search. In: Proc. of the 14th Annu. Int. Conf. on Genome Informatics (GIW 2003), pp. 164\u2013175 (2003)","key":"15_CR11"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1093\/bioinformatics\/18.3.440","volume":"18","author":"B. Ma","year":"2002","unstructured":"Ma, B., Tromp, J., Li, M.: PatternHunter \u2013 faster and more sensitive homology search. Bioinformatics\u00a018, 440\u2013445 (2002)","journal-title":"Bioinformatics"},{"issue":"4\/5","key":"15_CR13","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF01185432","volume":"12","author":"E. Myers","year":"1994","unstructured":"Myers, E.: A sublinear algorithm for approximate keyword searching. Algorithmica\u00a012(4\/5), 345\u2013374 (1994)","journal-title":"Algorithmica"},{"issue":"3","key":"15_CR14","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1145\/316542.316550","volume":"46","author":"E. Myers","year":"1999","unstructured":"Myers, E.: A fast bit-vector algorithm for approximate string matching based on dynamic programming. J. ACM\u00a046(3), 539\u2013553 (1999)","journal-title":"J. ACM"},{"issue":"2","key":"15_CR15","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1089\/106652703321825919","volume":"10","author":"E. Myers","year":"2003","unstructured":"Myers, E., Durbin, R.: A table-driven, full-sensitivity similarity search algorithm. J. Comp. Bio.\u00a010(2), 103\u2013118 (2003)","journal-title":"J. Comp. Bio."},{"issue":"10","key":"15_CR16","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1101\/gr.194201","volume":"11","author":"Z. Ning","year":"2001","unstructured":"Ning, Z., Cox, A.J., Mullikin, J.C.: SSAHA: A fast search method for large DNA databases. Genome Res.\u00a011(10), 1725\u20131729 (2001)","journal-title":"Genome Res."},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"2444","DOI":"10.1073\/pnas.85.8.2444","volume":"85","author":"W.R. Pearson","year":"1988","unstructured":"Pearson, W.R., Lipman, D.J.: Improved tools for biological sequence comparison. Proc. Natl. Acad. Sci. USA\u00a085, 2444\u20132448 (1988)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/0888-7543(91)90071-L","volume":"11","author":"W.R. Pearson","year":"1991","unstructured":"Pearson, W.R.: Searching protein sequence libraries: Comparison of the sensitivity and selectivity of the Smith-Waterman and FASTA algorithms. Genomics\u00a011, 635\u2013650 (1991)","journal-title":"Genomics"},{"issue":"1","key":"15_CR19","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T.F. Smith","year":"1981","unstructured":"Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. J. Mol. Biol.\u00a0147(1), 195\u2013197 (1981)","journal-title":"J. Mol. Biol."},{"issue":"1","key":"15_CR20","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"92","author":"E. Ukkonen","year":"1992","unstructured":"Ukkonen, E.: Approximate string-matching with q-grams and maximal matches. Theor. Comput. Sci.\u00a092(1), 191\u2013211 (1992)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Zhang, Z., Berman, P., Miller, W.: Alignments without low-scoring regions. In: Proc. of the 2nd Annu. Int. Conf. on Computational Molecular Biology (RECOMB 1998), pp. 294\u2013301 (1998)","key":"15_CR21","DOI":"10.1145\/279069.279137"},{"unstructured":"ftp:\/\/ftp.ncbi.nih.gov\/toolbox\/ncbi_tools\/ncbi.tar.gz","key":"15_CR22"},{"unstructured":"ftp:\/\/ftp.ncbi.nlm.nih.gov\/blast\/db\/FASTA\/est_human,mouse.gz","key":"15_CR23"},{"unstructured":"ftp:\/\/ftp.virginia.edu\/pub\/fasta","key":"15_CR24"},{"unstructured":"http:\/\/bibiserv.techfak.uni-bielefeld.de\/swift","key":"15_CR25"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11415770_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:56:01Z","timestamp":1558281361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11415770_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258667","9783540319504"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11415770_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}