{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T16:22:09Z","timestamp":1791217329334,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540223412","type":"print"},{"value":"9783540278016","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27801-6_22","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:00:15Z","timestamp":1283727615000},"page":"297-310","source":"Crossref","is-referenced-by-count":11,"title":["Multi-seed Lossless Filtration"],"prefix":"10.1007","author":[{"given":"Gregory","family":"Kucherov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laurent","family":"No\u00e9","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikhail","family":"Roytberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"22_CR1","first-page":"51","volume":"56","author":"S. Burkhardt","year":"2003","unstructured":"Burkhardt, S., K\u00e4rkk\u00e4inen, J.: Better filtering with gapped q-grams. Fundamenta Informaticae\u00a056, 51\u201370 (2003) ;Preliminary version in Combinatorial Pattern Matching (2001)","journal-title":"Fundamenta Informaticae"},{"key":"22_CR2","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1017\/CBO9781316135228","volume-title":"Flexible Pattern Matching in Strings \u2013 Practical on-line search algorithms for texts and biological sequences","author":"G. Navarro","year":"2002","unstructured":"Navarro, G., Raffinot, M.: Flexible Pattern Matching in Strings \u2013 Practical on-line search algorithms for texts and biological sequences, p. 280. Cambridge University Press, Cambridge (2002) ISBN 0-521-81307-7"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"3389","DOI":"10.1093\/nar\/25.17.3389","volume":"25","author":"S. Altschul","year":"1997","unstructured":"Altschul, S., Madden, T., Sch\u00e4ffer, A., Zhang, J., Zhang, Z., Miller, W., Lipman, D.: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Research\u00a025, 3389\u20133402 (1997)","journal-title":"Nucleic Acids Research"},{"key":"22_CR4","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":"22_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1101\/gr.809403","volume":"13","author":"S. Schwartz","year":"2003","unstructured":"Schwartz, S., Kent, J., Smit, A., Zhang, Z., Baertsch, R., Hardison, R., Haussler, D., Miller, W.: Human\u2013mouse alignments with BLASTZ. Genome Research\u00a013, 103\u2013107 (2003)","journal-title":"Genome Research"},{"key":"22_CR6","unstructured":"Noe, L., Kucherov, G.: YASS: Similarity search in DNA sequences. Research Report RR-4852, INRIA (2003), http:\/\/www.inria.fr\/rrrt\/rr-4852.html"},{"key":"22_CR7","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":"22_CR8","doi-asserted-by":"crossref","unstructured":"Califano, A., Rigoutsos, I.: Flash: A fast look-up algorithm for string homology. In: Proceedings of the 1st International Conference on Intelligent Systems for Molecular Biology, pp. 56\u201364 (1993)","DOI":"10.1109\/CVPR.1993.341106"},{"key":"22_CR9","first-page":"90","volume-title":"Proceedings of the 6th Annual International Conference on Computational Molecular Biology (RECOMB 2002)","author":"J. Buhler","year":"2002","unstructured":"Buhler, J.: Provably sensitive indexing strategies for biosequence similarity search. In: Proceedings of the 6th Annual International Conference on Computational Molecular Biology (RECOMB 2002), pp. 90\u201399. ACM Press, Washington (2002)"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Keich, U., Li, M., Ma, B., Tromp, J.: On spaced seeds for similarity search. Discrete Applied Mathematics (2004) (to appear)","DOI":"10.1016\/S0166-218X(03)00382-2"},{"key":"22_CR11","first-page":"67","volume-title":"Proceedings of the 7th Annual International Conference on Computational Molecular Biology (RECOMB 2003)","author":"J. Buhler","year":"2003","unstructured":"Buhler, J., Keich, U., Sun, Y.: Designing seeds for similarity search in genomic DNA. In: Proceedings of the 7th Annual International Conference on Computational Molecular Biology (RECOMB 2003), pp. 67\u201375. ACM Press, Berlin (2003)"},{"key":"22_CR12","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 specificity. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol.\u00a02812, pp. 39\u201354. Springer, Heidelberg (2003)"},{"key":"22_CR13","volume-title":"Proceedings of the IEEE 4th Symposium on Bioinformatics and Bioengineering (BIBE 2004)","author":"G. Kucherov","year":"2004","unstructured":"Kucherov, G., Noe, L., Ponty, Y.: Estimating seed sensitivity on homogeneous alignments. In: Proceedings of the IEEE 4th Symposium on Bioinformatics and Bioengineering (BIBE 2004), May 19-21, IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Choi, K., Zhang, L.: Sensitivity analysis and efficient method for identifying optimal spaced seeds. Journal of Computer and System Sciences (2003) (to appear)","DOI":"10.1016\/j.jcss.2003.04.002"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1093\/bioinformatics\/17.11.1067","volume":"17","author":"F. Li","year":"2001","unstructured":"Li, F., Stormo, G.: Selection of optimal DNA oligos for gene expression arrays. Bioinformatics\u00a017, 1067\u20131076 (2001)","journal-title":"Bioinformatics"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1093\/bioinformatics\/18.10.1340","volume":"18","author":"L. Kaderali","year":"2002","unstructured":"Kaderali, L., Schliep, A.: Selecting signature oligonucleotides to identify organisms using DNA arrays. Bioinformatics\u00a018, 1340\u20131349 (2002)","journal-title":"Bioinformatics"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1142\/S0219720003000125","volume":"1","author":"S. Rahmann","year":"2003","unstructured":"Rahmann, S.: Fast large scale oligonucleotide selection using the longest common factor approach. Journal of Bioinformatics and Computational Biology\u00a01, 343\u2013361 (2003)","journal-title":"Journal of Bioinformatics and Computational Biology"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/3-540-44888-8_28","volume-title":"Combinatorial Pattern Matching","author":"J. Zheng","year":"2003","unstructured":"Zheng, J., Close, T., Jiang, T., Lonardi, S.: Efficient selection of unique and popular oligos for large EST databases. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 384\u2013401. Springer, Heidelberg (2003)"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-45452-7_19","volume-title":"Combinatorial Pattern Matching","author":"S. Burkhardt","year":"2002","unstructured":"Burkhardt, S., Karkkainen, J.: One-gapped q-gram filtersfor levenshtein distance. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol.\u00a02373, pp. 225\u2013234. Springer, Heidelberg (2002)"},{"key":"#cr-split#-22_CR20.1","doi-asserted-by":"crossref","unstructured":"Li, M., Ma, B., Kisman, D., Tromp, J.: PatternHunter II: Highly sensitive and fast homology search. Journal of Bioinformatics and Computational Biology (2004);","DOI":"10.1142\/S0219720004000661"},{"key":"#cr-split#-22_CR20.2","unstructured":"Earlier version in GIW 2003 (International Conference on Genome Informatics)"},{"key":"22_CR21","volume-title":"Proceedings of the 8th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2004)","author":"Y. Sun","year":"2004","unstructured":"Sun, Y., Buhler, J.: Designing multiple simultaneous seeds for DNA similarity search. In: Proceedings of the 8th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2004), ACM Press, New York (2004)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27801-6_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T05:40:53Z","timestamp":1685770853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27801-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223412","9783540278016"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27801-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}