{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T17:22:32Z","timestamp":1790270552218,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540873600","type":"print"},{"value":"9783540873617","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87361-7_27","type":"book-chapter","created":{"date-parts":[[2008,9,17]],"date-time":"2008-09-17T12:59:00Z","timestamp":1221656340000},"page":"318-329","source":"Crossref","is-referenced-by-count":6,"title":["Computing Alignment Seed Sensitivity with Probabilistic Arithmetic Automata"],"prefix":"10.1007","author":[{"given":"Inke","family":"Herms","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sven","family":"Rahmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"2444","DOI":"10.1073\/pnas.85.8.2444","volume":"85","author":"W. Pearson","year":"1988","unstructured":"Pearson, W., Lipman, D.: Improved tools for biological sequence comparison. Proc. Natl. Acad. Sci. USA\u00a085, 2444\u20132448 (1988)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"27_CR2","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., Lipman, D.: Basic local alignment search tool. J. Mol. Biol\u00a0215, 403\u2013410 (1990)","journal-title":"J. Mol. Biol"},{"issue":"17","key":"27_CR3","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."},{"issue":"4","key":"27_CR4","first-page":"656","volume":"12","author":"W.J. Kent","year":"2002","unstructured":"Kent, W.J.: BLAT\u2013the blast-like alignment tool. Genome Res.\u00a012(4), 656\u2013664 (2002)","journal-title":"Genome Res."},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Gelfand, Y., Rodriguez, A., Benson, G.: TRDB\u2013the tandem repeats database. Nucleic Acids Res.\u00a035 (2007)","DOI":"10.1093\/nar\/gkl1013"},{"issue":"1","key":"27_CR6","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."},{"key":"27_CR7","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":"27_CR8","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 Research in computational molecular biology, pp. 67\u201375 (2003)","DOI":"10.1145\/640075.640083"},{"issue":"4","key":"27_CR9","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.G., Vinar, T.: Optimal spaced seeds for homologous coding regions. J. Bioinform. Comput. Biol.\u00a01(4), 595\u2013610 (2004)","journal-title":"J. Bioinform. Comput. Biol."},{"issue":"7","key":"27_CR10","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1093\/bioinformatics\/bth037","volume":"20","author":"K.P. Choi","year":"2004","unstructured":"Choi, K.P., Zeng, F., Zhang, L.: Good spaced seeds for homology search. Bioinformatics\u00a020(7), 1053\u20131059 (2004)","journal-title":"Bioinformatics"},{"issue":"2","key":"27_CR11","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1142\/S0219720006001977","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. J. Bioinform. Comput. Biol.\u00a04(2), 553\u2013569 (2006)","journal-title":"J. Bioinform. Comput. Biol."},{"issue":"3","key":"27_CR12","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.G., Vinar, T.: Vector seeds: an extension to spaced seeds. J. Computer System Sci.\u00a070(3), 364\u2013380 (2005)","journal-title":"J. Computer System Sci."},{"issue":"14","key":"27_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(14), e341\u2013e349 (2006)","journal-title":"Bioinformatics"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.jcss.2003.04.002","volume":"68","author":"K.P. Choi","year":"2004","unstructured":"Choi, K.P., Zhang, L.: Sensitivity analysis and efficient method for identifying optimal spaced seeds. J. Computer System Sci.\u00a068, 22\u201340 (2004)","journal-title":"J. Computer System Sci."},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/1109557.1109607","volume-title":"Proceedings of SODA 2006","author":"M. Li","year":"2006","unstructured":"Li, M., Ma, B., Zhang, L.: Superiority and complexity of the spaced seeds. In: Proceedings of SODA 2006, pp. 444\u2013453. SIAM, Philadelphia (2006)"},{"issue":"3","key":"27_CR16","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. J. Bioinform. Comput. Biol.\u00a02(3), 417\u2013439 (2004)","journal-title":"J. Bioinform. Comput. Biol."},{"issue":"1","key":"27_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TCBB.2005.13","volume":"2","author":"D.G. Brown","year":"2005","unstructured":"Brown, D.G.: Optimizing multiple seeds for protein homology search. IEEE\/ACM Trans. Comput. Biol. Bioinform.\u00a02(1), 29\u201338 (2005)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"1","key":"27_CR18","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/TCBB.2005.12","volume":"2","author":"G. Kucherov","year":"2005","unstructured":"Kucherov, G., No\u00e9, L., Roytberg, M.: Multiseed lossless filtration. IEEE\/ACM Trans. Comput. Biol. Bioinform.\u00a02(1), 51\u201361 (2005)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"6","key":"27_CR19","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1089\/cmb.2005.12.847","volume":"12","author":"Y. Sun","year":"2005","unstructured":"Sun, Y., Buhler, J.: Designing multiple simultaneous seeds for DNA similarity search. J. Comput. Biol.\u00a012(6), 847\u2013861 (2005)","journal-title":"J. Comput. Biol."},{"issue":"2","key":"27_CR20","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1089\/cmb.2006.0008","volume":"14","author":"Y. Kong","year":"2007","unstructured":"Kong, Y.: Generalized correlation functions and their applications in selection of optimal multiple spaced seeds for homology search. J. Comput. Biol.\u00a014(2), 238\u2013254 (2007)","journal-title":"J. Comput. Biol."},{"issue":"22","key":"27_CR21","doi-asserted-by":"publisher","first-page":"2969","DOI":"10.1093\/bioinformatics\/btm422","volume":"23","author":"L. Ilie","year":"2007","unstructured":"Ilie, L., Ilie, S.: Multiple spaced seeds for homology search. Bioinformatics\u00a023(22), 2969\u20132977 (2007)","journal-title":"Bioinformatics"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Mak, D.Y.F., Benson, G.: All hits all the time: Parameter free calculation of seed sensitivity. In: APBC. Advances in Bioinformatics and Computational Biology, vol.\u00a05, pp. 327\u2013340. Imperial College Press (2007)","DOI":"10.1142\/9781860947995_0035"},{"key":"27_CR23","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1186\/1471-2105-5-149","volume":"5","author":"L. No\u00e9","year":"2004","unstructured":"No\u00e9, L., Kucherov, G.: Improved hit criteria for DNA local alignment. BMC Bioinformatics\u00a05, 149 (2004)","journal-title":"BMC Bioinformatics"},{"issue":"1\/2","key":"27_CR24","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF01188584","volume":"13","author":"P.A. Pevzner","year":"1995","unstructured":"Pevzner, P.A., Waterman, M.S.: Multiple filtration and approximate pattern matching. Algorithmica\u00a013(1\/2), 135\u2013154 (1995)","journal-title":"Algorithmica"},{"key":"27_CR25","unstructured":"Marschall, T., Rahmann, S.: Probabilistic arithmetic automata and their application to pattern matching statistics. In: 19th Annual Symposium on Combinatorial Pattern Matching (accepted for publication, 2008)"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. Technical report, Stanford, CA, USA (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87361-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:34:55Z","timestamp":1714620895000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87361-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540873600","9783540873617"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87361-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}