{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:33:38Z","timestamp":1740548018912,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230182"},{"type":"electronic","value":"9783540302193"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004]]},"DOI":"10.1007\/978-3-540-30219-3_7","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T20:42:59Z","timestamp":1285101779000},"page":"74-86","source":"Crossref","is-referenced-by-count":10,"title":["Gapped Local Similarity Search with Provable Guarantees"],"prefix":"10.1007","author":[{"given":"Manikandan","family":"Narayanan","sequence":"first","affiliation":[]},{"given":"Richard M.","family":"Karp","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S. Altschul","year":"1990","unstructured":"Altschul, S., Gish, W., Miller, W., Myers, E., Lipman, D.: Basic local alignment search tool. Journal of Molecular Biology\u00a0215(3), 403\u2013410 (1990)","journal-title":"Journal of Molecular Biology"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"A. Borodin, R. Ostrovsky, and Y. Rabani. Subquadratic approximation algorithms for clustering problems in high dimensional spaces. In Proc. 31st Symp. on Theory of Computing, pages 435\u2013444, 1999.","DOI":"10.1145\/301250.301367"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1101\/gr.789803","volume":"13","author":"N. Bray","year":"2003","unstructured":"Bray, N., Dubchak, I., Pachter, L.: Avid: A global alignment program. Genome Research\u00a013(1), 97\u2013102 (2003)","journal-title":"Genome Research"},{"key":"7_CR4","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-39763-2_4","volume-title":"Algorithms in Bioinformatics","author":"B. Brejova","year":"2003","unstructured":"Brejova, B., Brown, D., Vinar, T.: Vector seeds: An extension to spaced seeds allows substantial improvements in sensitivity and specifity. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol.\u00a02812, pp. 39\u201354. Springer, Heidelberg (2003)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Broder, A., Charikar, M., Frieze, A., Mitzenmacher, M.: Min-wise independent permutations. In: Proc. 30th Symp. on Theory of Computing, pp. 327\u2013336 (1998)","DOI":"10.1145\/276698.276781"},{"key":"7_CR6","unstructured":"Broder, A., Glassman, S., Manasse, M., Zweig, G.: Syntactic clustering of the web. In: Proc. 6th Intl. World Wide Web Conf., pp. 391\u2013404 (1997)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Brudno, M., Morgenstern, B.: Fast and sensitive alignment of large genomic sequences. In: Proc. IEEE Comp. Soc. Bioinformatics Conf., pp. 138\u2013147 (2002)","DOI":"10.1186\/1471-2105-4-66"},{"issue":"5","key":"7_CR8","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1093\/bioinformatics\/17.5.419","volume":"17","author":"J. Buhler","year":"2001","unstructured":"Buhler, J.: Efficient large-scale sequence comparison by locality-sensitive hashing. Bioinformatics\u00a017(5), 419\u2013428 (2001)","journal-title":"Bioinformatics"},{"key":"7_CR9","unstructured":"Buhler, J.: Search Algorithms for Biosequences Using Random Projection. PhD thesis, University of Washington (2001)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Burkhardt, S., Crauser, A., Ferragina, P., Lenhof, H., Rivals, E., Vingron, M.: qgram based database searching using a suffix array. In: Proc. 3rd Conf. on Research in Comp. Molecular Biology, pp. 77\u201383 (1999)","DOI":"10.1145\/299432.299460"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Burkhardt, S., Karkkainen, J.: Better filtering with gapped q-grams. In: Proc. 12th Symp. on Comb. Pattern Matching, pp. 73\u201385 (2001)","DOI":"10.1007\/3-540-48194-X_6"},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1006\/jcss.1997.1534","volume":"55","author":"E. Cohen","year":"1997","unstructured":"Cohen, E.: Size-estimation framework with applications to transitive closure and reachability. Journal of Computer and System Sciences\u00a055(3), 441\u2013453 (1997)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/69.908981","volume":"13","author":"E. Cohen","year":"2001","unstructured":"Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., Ullman, J., Yang, C.: Finding interesting associations without support pruning. IEEE Trans. on Knowledge and Data Engineering\u00a013(1), 64\u201378 (2001)","journal-title":"IEEE Trans. on Knowledge and Data Engineering"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Fredriksson, K., Navarro, G.: Improved single and multiple approximate string matching. In: 15th Symp. on Comb. Pattern Matching (2004) (to appear)","DOI":"10.1007\/978-3-540-27801-6_35"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences, chapter 11.6.5 (Approximate occurrences of P in T). Cambridge Univ. Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"key":"7_CR16","unstructured":"Haveliwala, T., Gionis, A., Indyk, P.: Scalable techniques for clustering the web. In: Proc. 3rd Intl. Workshop on the Web and Databases (2000)"},{"key":"7_CR17","unstructured":"Indyk, P.: A small approximately min-wise independent family of hash functions. In: Proc. 10th Symp. on Discrete Algorithms, pp. 454\u2013456 (1999)"},{"key":"7_CR18","unstructured":"Indyk, P.: Nearest neighbors in high-dimensional spaces. In: Handbook of Discrete and Comp. Geometry, 2nd edn., CRC Press LLC (Upcoming)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proc. 30th Symp. on Theory of Computing, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Karp, R., Waarts, O., Zweig, G.: The bit vector intersection problem. In: Proc. 36th Symp. on Foundations of Computer Science, pp. 621\u2013630 (1995)","DOI":"10.1109\/SFCS.1995.492663"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R., Rabani, Y.: Efficient search for approximate nearest neighbor in high dimensional spaces. In: Proc. 30th Symp. on Theory of Computing, pp. 614\u2013623 (1998)","DOI":"10.1145\/276698.276877"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Landau, G., Vishkin, U.: Introducing efficient parallelism into approximate string matching and a new serial algorithm. In: Proc. 18th Symp. on Theory of Computing, pp. 220\u2013230 (1986)","DOI":"10.1145\/12130.12152"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Lippert, R., Zhao, X., Florea, L., Mobarry, C., Istrail, S.: Finding anchors for genomic sequence comparison. In: Proc. 8th Conf. on Research in Comp.Molecular Biology, pp. 233\u2013241 (2004)","DOI":"10.1145\/974614.974645"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S., Sahinalp, S.: Simple and practical sequence nearest neighbors with block operations. In: Proc. 13th Symp. on Comb. Pattern Matching, pp. 262\u2013278 (2002)","DOI":"10.1007\/3-540-45452-7_22"},{"issue":"2","key":"7_CR25","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01840446","volume":"1","author":"E. Myers","year":"1986","unstructured":"Myers, E.: An O(ND) Difference Algorithm and Its Variations. Algorithmica\u00a01(2), 251\u2013266 (1986)","journal-title":"Algorithmica"},{"issue":"1","key":"7_CR26","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(1), 31\u201388 (2001)","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"7_CR27","first-page":"121","volume":"8","author":"P. Pevzner","year":"1992","unstructured":"Pevzner, P.: Statistical distance between texts and filtration methods in sequence comparison. CABIOS\u00a08(2), 121\u2013127 (1992)","journal-title":"CABIOS"},{"issue":"1","key":"7_CR28","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1101\/gr.809403","volume":"13","author":"S. Schwartz","year":"2003","unstructured":"Schwartz, S., Kent, W., Smit, A., Zhang, Z., Baertsch, R., Hardison, R., Haussler, D., Miller, W.: Human-mouse alignments with blastz. Genome Research\u00a013(1), 103\u2013107 (2003)","journal-title":"Genome Research"},{"issue":"1","key":"7_CR29","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T. Smith","year":"1981","unstructured":"Smith, T., Waterman, M.: Identification of common molecular subsequences. Journal of Molecular Biology\u00a0147(1), 195\u2013197 (1981)","journal-title":"Journal of Molecular Biology"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Sutinen, E., Tarhio, J.: On using q-gram locations in approximate string matching. In: Proc. European Symp. on Algorithms, pp. 327\u2013340 (1995)","DOI":"10.1007\/3-540-60313-1_153"},{"issue":"1","key":"7_CR31","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. Theoretical Computer Science\u00a092(1), 191\u2013211 (1992)","journal-title":"Theoretical Computer Science"},{"key":"7_CR32","unstructured":"NCBI Entrez Genomes, http:\/\/www.ncbi.nlm.nih.gov\/entrez\/query.fcgi?db=Genome"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30219-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T23:48:08Z","timestamp":1740527288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30219-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230182","9783540302193"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30219-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}