{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T16:05:41Z","timestamp":1758125141480},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540763352"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76336-9_18","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T05:44:48Z","timestamp":1193463888000},"page":"180-191","source":"Crossref","is-referenced-by-count":6,"title":["Subset Seed Automaton"],"prefix":"10.1007","author":[{"given":"Gregory","family":"Kucherov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"No\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail","family":"Roytberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","first-page":"553","volume":"4","author":"G. Kucherov","year":"2006","unstructured":"Kucherov, G., No\u00e9, L., Roytberg, M.: A unifying framework for seed sensitivity and its application to subset seeds. JBCB\u00a04, 553\u2013569 (2006)","journal-title":"JBCB"},{"key":"18_CR2","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)","journal-title":"Fundamenta Informaticae"},{"key":"18_CR3","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":"18_CR4","first-page":"819","volume":"2","author":"D. Brown","year":"2004","unstructured":"Brown, D., Li, M., Ma, B.: A tutorial of recent developments in the seeding of local alignment. JBCB\u00a02, 819\u2013842 (2004)","journal-title":"JBCB"},{"doi-asserted-by":"crossref","unstructured":"Brown, D.: A survey of seeding for sequence alignments. In: Bioinformatics Algorithms: Techniques and Applications (to appear, 2007)","key":"18_CR5","DOI":"10.1002\/9780470253441.ch6"},{"key":"18_CR6","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 and fast homology search. Journal of Bioinformatics and Computational Biology\u00a02, 417\u2013439 (2004)","journal-title":"Journal of Bioinformatics and Computational Biology"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1093\/nar\/gki478","volume":"33","author":"L. No\u00e9","year":"2005","unstructured":"No\u00e9, L., Kucherov, G.: YASS: enhancing the sensitivity of DNA similarity search. Nucleic Acids Research\u00a033(web-server issue), W540\u2013W543 (2005)","journal-title":"Nucleic Acids Research"},{"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 (ISMB), pp. 56\u201364 (1993)","key":"18_CR8","DOI":"10.1109\/CVPR.1993.341106"},{"key":"18_CR9","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/11851561_34","volume-title":"Algorithms in Bioinformatics","author":"D. Tsur","year":"2006","unstructured":"Tsur, D.: Optimal probing patterns for sequencing by hybridization. In: B\u00fccher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol.\u00a04175, pp. 366\u2013375. Springer, Heidelberg (2006)"},{"key":"18_CR10","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"},{"doi-asserted-by":"crossref","unstructured":"Sun, Y., Buhler, J.: Choosing the best heuristic for seeded alignment of DNA sequences. BMC Bioinformatics 7 (2006)","key":"18_CR11","DOI":"10.1186\/1471-2105-7-133"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/11533719_13","volume-title":"Computing and Combinatorics","author":"M. Cs\u00fcr\u00f6s","year":"2005","unstructured":"Cs\u00fcr\u00f6s, M., Ma, B.: Rapid homology search with two-stage extension and daughter seeds. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 104\u2013114. Springer, Heidelberg (2005)"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1093\/bioinformatics\/btl263","volume":"22","author":"D. Mak","year":"2006","unstructured":"Mak, D., Gelfand, Y., Benson, G.: Indel seeds for homology search. Bioinformatics\u00a022, e341\u2013e349 (2006)","journal-title":"Bioinformatics"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/j.jcss.2004.12.008","volume":"70","author":"B. Brejov\u00e1","year":"2005","unstructured":"Brejov\u00e1, B., Brown, D., Vinar, T.: Vector seeds: An extension to spaced seeds. Journal of Computer and System Sciences\u00a070, 364\u2013380 (2005)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR15","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, 253\u2013263 (2004) preliminary version in 2002.","journal-title":"Discrete Applied Mathematics"},{"doi-asserted-by":"crossref","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), pp. 67\u201375 (2003)","key":"18_CR16","DOI":"10.1145\/640075.640083"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1142\/S0219720004000326","volume":"1","author":"B. Brejov\u00e1","year":"2004","unstructured":"Brejov\u00e1, B., Brown, D., Vinar, T.: Optimal spaced seeds for homologous coding regions. Journal of Bioinformatics and Computational Biology\u00a01, 595\u2013610 (2004)","journal-title":"Journal of Bioinformatics and Computational Biology"},{"unstructured":"Cole, R., Hariharan, R., Indyk, P.: Tree pattern matching and subset matching in deterministic O(nlog3 n)-time. In: Proceedings of 10th Symposium on Discrete Algorithms (SODA), pp. 245\u2013254 (1999)","key":"18_CR18"},{"unstructured":"Holub, J., Smyth, W.F., Wang, S.: Fast pattern-matching on indeterminate strings. Journal of Discrete Algorithms (2006)","key":"18_CR19"},{"unstructured":"Rahman, S., Iliopoulos, C., Mouchard, L.: Pattern matching in degenerate DNA\/RNA sequences. In: Proceedings of the Workshop on Algorithms and Computation (WALCOM), pp. 109\u2013120 (2007)","key":"18_CR20"},{"doi-asserted-by":"crossref","unstructured":"No\u00e9, L., Kucherov, G.: Improved hit criteria for DNA local alignment. BMC Bioinformatics\u00a05 (2004)","key":"18_CR21","DOI":"10.1186\/1471-2105-5-149"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: An aid to bibliographic search. Communications of the ACM\u00a018, 333\u2013340 (1975)","journal-title":"Communications of the ACM"},{"unstructured":"Amir, A., Porat, E., Lewenstein, M.: Approximate subset matching with don\u2019t cares. In: Proceedings of 12th Symposium on Discrete Algorithms (SODA), pp. 305\u2013306 (2001)","key":"18_CR23"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76336-9_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:48:07Z","timestamp":1619520487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76336-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540763352"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76336-9_18","relation":{},"subject":[]}}