{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:17:53Z","timestamp":1725491873082},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755296"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75530-2_25","type":"book-chapter","created":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T14:26:50Z","timestamp":1190212010000},"page":"276-286","source":"Crossref","is-referenced-by-count":6,"title":["Algorithms for Weighted Matching"],"prefix":"10.1007","author":[{"given":"Leena","family":"Salmela","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorma","family":"Tarhio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"10","key":"25_CR1","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R., Gonnet, G.: A new approach to text searching. Communications of the ACM\u00a035(10), 74\u201382 (1992)","journal-title":"Communications of the ACM"},{"issue":"5","key":"25_CR2","first-page":"431","volume":"12","author":"J.M. Claverie","year":"1996","unstructured":"Claverie, J.M., Audic, S.: The statistical significance of nucleotide position-weight matrix matches. Computer Applications in Biosciences\u00a012(5), 431\u2013439 (1996)","journal-title":"Computer Applications in Biosciences"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R. Karp","year":"1987","unstructured":"Karp, R., Rabin, M.: Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development\u00a031, 160\u2013249 (1987)","journal-title":"IBM Journal of Research and Development"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/11780441_36","volume-title":"Combinatorial Pattern Matching","author":"A. Liefooghe","year":"2006","unstructured":"Liefooghe, A., Touzet, H., Varr\u00e9, J.S.: Large scale matching for position weight matrices. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 401\u2013412. Springer, Heidelberg (2006)"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1093\/nar\/gkg108","volume":"31","author":"V. Matys","year":"2003","unstructured":"Matys, V., Fricke, E., Geffers, R., G\u00f6\u00dfling, E., Haubrock, M., Hehl, R., Hornischer, K., Karas, D., Kel, A., Kel-Margoulis, O., Kloos, D., Land, S., Lewicki-Potapov, B., Michael, H., M\u00fcnch, R., Reuter, I., Rotert, S., Saxel, H., Scheer, M., Thiele, S., Wingender, E.: TRANSFAC: transcriptional regulation, from patterns to profiles. Nucleic Acids Res.\u00a031, 374\u2013378 (2003)","journal-title":"Nucleic Acids Res."},{"issue":"4","key":"25_CR6","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 Algorithmics\u00a05(4), 1\u201336 (2000)","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"25_CR7","series-title":"LNCS (LNBI)","first-page":"239","volume-title":"BIRD 2007","author":"C. Pizzi","year":"2007","unstructured":"Pizzi, C., Rastas, P., Ukkonen, E.: Fast search algorithms for position specific scoring matrices. In: Hochreiter, S., Wagner, R. (eds.) BIRD 2007. LNCS (LNBI), vol.\u00a04414, pp. 239\u2013250. Springer, Berlin (2007)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Pizzi, C., Ukkonen, E.: Fast profile matching algorithms \u2013 a survey. Theoretical Computer Science (to appear)","DOI":"10.1016\/j.tcs.2008.01.015"},{"key":"25_CR9","first-page":"1","volume":"11","author":"L. Salmela","year":"2006","unstructured":"Salmela, L., Tarhio, J., Kyt\u00f6joki, J.: Multi-pattern string matching with q-grams. ACM Journal of Experimental Algorithmics\u00a011, 1\u201319 (2006)","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"25_CR10","first-page":"89","volume":"5","author":"R. Staden","year":"1989","unstructured":"Staden, R.: Methods for calculating the probabilities of finding patterns in sequences. Computer Applications in Biosciences\u00a05, 89\u201396 (1989)","journal-title":"Computer Applications in Biosciences"},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1093\/bioinformatics\/16.3.233","volume":"16","author":"T. Wu","year":"2000","unstructured":"Wu, T., Neville-Manning, C., Brutlag, D.: Fast probabilistic analysis of sequence function using scoring matrices. Bioinformatics\u00a016(3), 233\u2013244 (2000)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75530-2_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:23:20Z","timestamp":1619519000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75530-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755296"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75530-2_25","relation":{},"subject":[]}}