{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T16:21:07Z","timestamp":1791217267568,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540275800","type":"print"},{"value":"9783540316916","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_101","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:58:59Z","timestamp":1279479539000},"page":"1251-1262","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Spaced Seeds for Faster Approximate String Matching"],"prefix":"10.1007","author":[{"given":"Martin","family":"Farach-Colton","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S. Cenk","family":"Sahinalp","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dekel","family":"Tsur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"101_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., Gisch, W., Miller, W., Myers, E., Lipman, D.: Basic local alignment search tool. J. of Molecular Biology\u00a0215(3), 403\u2013410 (1990)","journal-title":"J. of Molecular Biology"},{"key":"101_CR2","unstructured":"Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k-mismatches. In: Proc. ACM-SIAM SODA, pp. 794\u2013803 (2000)"},{"key":"101_CR3","doi-asserted-by":"crossref","unstructured":"Brejova, B., Brown, D.G., Vinar, T.: Vector seeds: an extension to spaced seeds allows substantial improvements in sensitivity and specificity. In: Proc. WABI, pp. 39\u201354 (2003)","DOI":"10.1007\/978-3-540-39763-2_4"},{"key":"101_CR4","doi-asserted-by":"crossref","unstructured":"Buhler, J.: Provably sensitive indexing strategies for biosequence similarity search. In: Proc. ACM RECOMB, pp. 90\u201399 (2002)","DOI":"10.1145\/565196.565208"},{"key":"101_CR5","doi-asserted-by":"crossref","unstructured":"Buhler, J., Keich, U., Sun, Y.: Designing seeds for similarity search in genomic DNA. In: Proc. ACM RECOMB, pp. 67\u201375 (2003)","DOI":"10.1145\/640075.640083"},{"key":"101_CR6","first-page":"51","volume":"56","author":"S. Burkhardt","year":"2003","unstructured":"Burkhardt, S., Karkkainen, J.: Better filtering with gapped q-grams. Fundamenta Informaticae\u00a056, 51\u201370 (2003)","journal-title":"Fundamenta Informaticae"},{"key":"101_CR7","doi-asserted-by":"crossref","unstructured":"Califano, A., Rigoutsos, I.: Flash: a fast look-up algorithm for string homology. In: Proc. ISMB, pp. 56\u201364 (1993)","DOI":"10.1109\/CVPR.1993.341106"},{"key":"101_CR8","unstructured":"Cole, R., Hariharan, R.: Approximate string matching, a simpler, faster algorithm. In: Proc. ACM-SIAM SODA, pp. 463\u2013472 (1997)"},{"key":"101_CR9","unstructured":"Karpinski, M., Zelikovsky, A.: Approximating dense cases of covering. Electronic Colloquium on Computational Complexity\u00a04(4) (1997)"},{"issue":"3","key":"101_CR10","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0166-218X(03)00382-2","volume":"138","author":"U. Keich","year":"2004","unstructured":"Keich, U., Li, M., Ma, B., Tromp, J.: On spaced seeds for similarity search. Discrete Applied Mathematics\u00a0138(3), 253\u2013263 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"101_CR11","doi-asserted-by":"crossref","unstructured":"Kucherov, G., No\u00e9, L., Roytberg, M.: Multi-seed lossless filtration. In: Proc. CPM, pp. 297\u2013310 (2004)","DOI":"10.1007\/978-3-540-27801-6_22"},{"key":"101_CR12","doi-asserted-by":"crossref","unstructured":"Kucherov, G., No\u00e9, L., Ponty, Y.: Estimating seed sensitivity on homogeneous alignments. In: Proc. IEEE BIBE, pp. 387\u2013394 (2004)","DOI":"10.1109\/BIBE.2004.1317369"},{"issue":"2","key":"101_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G.M. Landau","year":"1989","unstructured":"Landau, G.M., Vishkin, U.: Fast parallel and serial approximate string matching. Journal of Algorithms\u00a010(2), 157\u2013169 (1989)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"101_CR14","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1142\/S0219720004000661","volume":"2","author":"M. Li","year":"2004","unstructured":"Li, M., Ma, B., Kisman, D., Tromp, J.: Patternhunter II: Highly sensitive fast homology search. J. of Bioinformatics and Computational Biology\u00a02(3), 417\u2013439 (2004)","journal-title":"J. of Bioinformatics and Computational Biology"},{"key":"101_CR15","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: Faster and more sensitive homology search. Bioinformatics\u00a018, 440\u2013445 (2002)","journal-title":"Bioinformatics"},{"key":"101_CR16","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF01188584","volume":"13","author":"P. Pevzner","year":"1995","unstructured":"Pevzner, P., Waterman, M.: Multiple filtration and approximate pattern matching. Algorithmica\u00a013, 135\u2013154 (1995)","journal-title":"Algorithmica"},{"key":"101_CR17","doi-asserted-by":"crossref","unstructured":"Sahinalp, S.C., Vishkin, U.: Efficient approximate and dynamic matching of patterns using a labeling paradigm. In: Proc. IEEE FOCS, pp. 320\u2013328 (1996)","DOI":"10.1109\/SFCS.1996.548491"},{"key":"101_CR18","doi-asserted-by":"crossref","unstructured":"Sun, Y., Buhler, J.: Designing multiple simultaneous seeds for DNA similarity search. In: Proc. ACM RECOMB, pp. 76\u201384 (2004)","DOI":"10.1145\/974614.974625"},{"key":"101_CR19","doi-asserted-by":"crossref","unstructured":"Xu, J., Brown, D., Li, M., Ma, B.: Optimizing multiple spaced seeds for homology search. In: Proc. CPM, pp. 47\u201358 (2004)","DOI":"10.1007\/978-3-540-27801-6_4"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_101.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:46:50Z","timestamp":1619506010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11523468_101","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}