{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:20:08Z","timestamp":1771024808550,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540705987","type":"print"},{"value":"9783540706007","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70600-7_31","type":"book-chapter","created":{"date-parts":[[2008,8,29]],"date-time":"2008-08-29T15:14:34Z","timestamp":1220022874000},"page":"417-426","source":"Crossref","is-referenced-by-count":15,"title":["Comparison of Exact String Matching Algorithms for Biological Sequences"],"prefix":"10.1007","author":[{"given":"Petri","family":"Kalsi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hannu","family":"Peltola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorma","family":"Tarhio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"31_CR1","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1002\/spe.4380190305","volume":"19","author":"R. Baeza-Yates","year":"1989","unstructured":"Baeza-Yates, R.: Improved string searching. Software: Practice and Experience\u00a019(3), 257\u2013271 (1989)","journal-title":"Software: Practice and Experience"},{"key":"31_CR2","unstructured":"Berry, T., Ravindran, S.: A fast string matching algorithm and experimental results. Proc. of the Prague Stringology Club Workshop 1999, Czech Technical University, Prague, Czech Republic, Collaborative Report DC-99-05, pp. 16\u201328 (1999)"},{"issue":"10","key":"31_CR3","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J S.: A fast string searching algorithm. Communications of the ACM\u00a020(10), 762\u2013772 (1977)","journal-title":"Communications of the ACM"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/11575832_42","volume-title":"String Processing and Information Retrieval","author":"K. Fredriksson","year":"2005","unstructured":"Fredriksson, K., Grabowski, Sz.: Practical and optimal string matching. In: Consens, M.P., Navarro, G. (eds.) SPIRE 2005. LNCS, vol.\u00a03772, pp. 376\u2013387. Springer, Heidelberg (2005)"},{"key":"31_CR5","unstructured":"Fredriksson, K.: Personal communication"},{"key":"31_CR6","unstructured":"Holub, J., \u010eurian, B.: Fast variants of bit parallel approach to suffix automata (Unpublished Lecture) University of Haifa 04-05 (2005)"},{"issue":"6","key":"31_CR7","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"R.N. Horspool","year":"1980","unstructured":"Horspool, R.N.: Practical fast searching in strings. Software: Practice and Experience\u00a010(6), 501\u2013506 (1980)","journal-title":"Software: Practice and Experience"},{"issue":"11","key":"31_CR8","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1002\/spe.4380211105","volume":"21","author":"A. Hume","year":"1991","unstructured":"Hume, A., Sunday, D.: Fast string searching. Software: Practice and Experience\u00a021(11), 1221\u20131248 (1991)","journal-title":"Software: Practice and Experience"},{"key":"31_CR9","unstructured":"Hyyr\u00f6, H.: Personal communication"},{"issue":"1","key":"31_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/spe.4380240105","volume":"24","author":"J.Y. Kim","year":"1994","unstructured":"Kim, J.Y., Shawe-Taylor, J.: Fast string matching using an n-gram algorithm. Software: Practice and Experience\u00a024(1), 79\u201388 (1994)","journal-title":"Software: Practice and Experience"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-540-74450-4_25","volume-title":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","author":"J.W. Kim","year":"2007","unstructured":"Kim, J.W., Kim, E., Park, K.: Fast matching method for DNA sequences. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol.\u00a04614, pp. 271\u2013281. Springer, Heidelberg (2007)"},{"issue":"1","key":"31_CR12","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM Journal on Computing\u00a06(1), 323\u2013350 (1977)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"31_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.ipl.2007.01.002","volume":"102","author":"T. Lecroq","year":"2007","unstructured":"Lecroq, T.: Fast exact string matching algorithms. Information Processing Letters\u00a0102(6), 229\u2013235 (2007)","journal-title":"Information Processing Letters"},{"issue":"4","key":"31_CR14","first-page":"1","volume":"5","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., Raffinot, M.: Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithms\u00a05(4), 1\u201336 (2000)","journal-title":"ACM Journal of Experimental Algorithms"},{"key":"31_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/978-3-540-39984-1_7","volume-title":"String Processing and Information Retrieval","author":"H. Peltola","year":"2003","unstructured":"Peltola, H., Tarhio, J.: Alternative algorithms for bit-parallel string matching. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.\u00a02857, pp. 80\u201393. Springer, Heidelberg (2003)"},{"issue":"4","key":"31_CR16","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1021\/ci030463z","volume":"44","author":"S.S. Sheik","year":"2004","unstructured":"Sheik, S.S., Aggarwal, S.K., Poddar, A., Balakrishnan, N., Sekar, K.: A FAST pattern matching algorithm. J. Chem. Inf. Comput. Sci.\u00a044(4), 1251\u20131256 (2004)","journal-title":"J. Chem. Inf. Comput. Sci."},{"issue":"8","key":"31_CR17","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/79173.79184","volume":"33","author":"D.M. Sunday","year":"1990","unstructured":"Sunday, D.M.: A very fast substring search algorithm. Communications of the ACM\u00a033(8), 132\u2013142 (1990)","journal-title":"Communications of the ACM"},{"issue":"7","key":"31_CR18","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1002\/(SICI)1097-024X(199707)27:7<851::AID-SPE108>3.0.CO;2-D","volume":"27","author":"J. Tarhio","year":"1997","unstructured":"Tarhio, J., Peltola, H.: String matching in the DNA alphabet. Software: Practice and Experience\u00a027(7), 851\u2013861 (1997)","journal-title":"Software: Practice and Experience"},{"issue":"1","key":"31_CR19","first-page":"47","volume":"91","author":"R. Thathoo","year":"2006","unstructured":"Thathoo, R., Virmani, A., Sai Lakshmi, S., Balakrishnan, N., Sekar, K.: TVSBS: A fast exact pattern matching algorithm for biological sequences. Current Science\u00a091(1), 47\u201353 (2006)","journal-title":"Current Science"},{"key":"31_CR20","unstructured":"Wu, S., Manber, U.: A fast algorithm for multi-pattern searching, Report TR-94-17, Department of Computer Science, University of Arizona, Tucson, AZ (1994)"},{"issue":"3","key":"31_CR21","first-page":"173","volume":"10","author":"R.F. Zhu","year":"1987","unstructured":"Zhu, R.F., Takaoka, T.: On improving the average case of the Boyer\u2013Moore string matching algorithm. Journal of Information Processing\u00a010(3), 173\u2013177 (1987)","journal-title":"Journal of Information Processing"}],"container-title":["Communications in Computer and Information Science","Bioinformatics Research and Development"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70600-7_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:24:19Z","timestamp":1620015859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70600-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705987","9783540706007"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70600-7_31","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[]}}