{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:55:08Z","timestamp":1725555308312},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130724"},{"type":"electronic","value":"9783642130731"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13073-1_30","type":"book-chapter","created":{"date-parts":[[2010,5,10]],"date-time":"2010-05-10T04:09:58Z","timestamp":1273464598000},"page":"335-346","source":"Crossref","is-referenced-by-count":3,"title":["An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences"],"prefix":"10.1007","author":[{"given":"Hui","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Qing","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/0216067","volume":"16","author":"K. Abrahamson","year":"1987","unstructured":"Abrahamson, K.: Generalized string matching. SIAM Journal of Computing\u00a016, 1039\u20131051 (1987)","journal-title":"SIAM Journal of Computing"},{"key":"30_CR2","unstructured":"Amir, A., Chencinski, E., Iliopoulos, C.S., Zhang, H.: A General Algorithmic Framework for Weighted Matching with a Given Fixed Probability. In: The 2nd Haifa Annual International Stringologyogy, Research Workshop of the Israeli Science Foundation, Israel (2005)"},{"issue":"10","key":"30_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 ACM\u00a020(10), 762\u2013772 (1977)","journal-title":"Communications of ACM"},{"issue":"2","key":"30_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/PL00009253","volume":"23","author":"R. Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R., Navarro, G.: Faster approximate string matching. Algorithmica\u00a023(2), 127\u2013158 (1999)","journal-title":"Algorithmica"},{"key":"30_CR5","unstructured":"Christodoulakis, M.: PHD Thesis Regularities on Fixed and Weighted Sequences. King\u2019s College University of London (2005)"},{"key":"30_CR6","unstructured":"Christodoulakis, M., Iliopoulos, C.S., Mouchard, L., Tsichlas, K.: Pattern Matching on Weighted Sequences. In: Proc. of the Algorithms and Computational Methods for Biochemical and Evolutionary Networks (CompBioNets), pp. 17\u201330 (2004)"},{"key":"30_CR7","volume-title":"Handbook of Exact string Matching Algorithms","author":"C. Charras","year":"2004","unstructured":"Charras, C., Lecroq, T.: Handbook of Exact string Matching Algorithms. King\u2019s College London Publications, London (2004)"},{"key":"30_CR8","unstructured":"Fischer, M., Paterson, M.: String Matching and Other Products. In: Complexity of Computation SIAM-AMS Proceedings, pp. 113\u2013125 (1974)"},{"key":"30_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Iliopoulos, C.S., McHugh, J., Peterlongo, P., Pisanti, N., Rytter, W., Sagot, M.: A First Approach to Finding Common Motifs with Gaps. Int. J. of Foundations of Computer Science (2004)","DOI":"10.1142\/S0129054105003716"},{"key":"30_CR11","unstructured":"Iliopoulos, C.S., Makris, C., Panagis, Y., Perdikuri, K.: Efficient Algorithms for Handling Molecular Weighted Sequences. In: Proc. of the 3rd IFIP-Theoretical Computer Science, pp. 273\u2013285 (2004)"},{"key":"30_CR12","first-page":"265","volume":"147","author":"C.S. Iliopoulos","year":"2004","unstructured":"Iliopoulos, C.S., Makris, C., Panagis, Y., Perdikuri, K., Theodoridis, E., Tsakalidis, A.: Efficient Algorithms for Handling Molecular Weighted Sequences. IFIP Theoretical Computer Science\u00a0147, 265\u2013278 (2004)","journal-title":"IFIP Theoretical Computer Science"},{"issue":"1","key":"30_CR13","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 Computing\u00a06(1), 323\u2013350 (1977)","journal-title":"SIAM Journal Computing"},{"issue":"2","key":"30_CR14","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R.M. Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern\u2013matching algorithms. IBM Journal on Research Development\u00a031(2), 249\u2013260 (1987)","journal-title":"IBM Journal on Research Development"},{"key":"30_CR15","unstructured":"Kurtz, S.: Approximate string searching under weighted edit distance. In: Proc. of the 3rd South American Workshop on String Processing (WSP 1996), pp. 156\u2013170 (1996)"},{"issue":"2","key":"30_CR16","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G.M. Landau","year":"1989","unstructured":"Landau, G.M., Viskin, U.: Fast Parallel and Serial Approximate String Matching. Journal of Algorithms\u00a010(2), 157\u2013169 (1989)","journal-title":"Journal of Algorithms"},{"key":"30_CR17","volume-title":"Computing Patterns in Strings","author":"W.F. Smyth","year":"2003","unstructured":"Smyth, W.F.: Computing Patterns in Strings. Pearson\/Addison-Wesley, Harlow (2003)"},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01769703","volume":"10","author":"E. Ukkonen","year":"1993","unstructured":"Ukkonen, E., Wood, D.G.M.: Approximate string matching with suffix automata. Algorithmica\u00a010, 353\u2013364 (1993)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13073-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T22:46:32Z","timestamp":1559083592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13073-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130724","9783642130731"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13073-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}