乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T14:41:31Z","timestamp":1712414491638},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":2147,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Discrete Algorithms"],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1016\/j.jda.2006.10.001","type":"journal-article","created":{"date-parts":[[2006,12,5]],"date-time":"2006-12-05T12:11:14Z","timestamp":1165320674000},"page":"514-523","source":"Crossref","is-referenced-by-count":26,"title":["Generalized function matching"],"prefix":"10.1016","volume":"5","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[]},{"given":"Igor","family":"Nor","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/j.jda.2006.10.001_bib001","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1137\/0216067","article-title":"Generalized string matching","volume":"16","author":"Abrahamson","year":"1987","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/j.jda.2006.10.001_bib002","doi-asserted-by":"crossref","unstructured":"A. Amir, A. Aumann, R. Cole, M. Lewenstein, E. Porat, Function matching: Algorithms, applications, and a lower bound, in: Proc. 30th ICALP, 2003, pp. 929\u2013942","DOI":"10.1007\/3-540-45061-0_72"},{"key":"10.1016\/j.jda.2006.10.001_bib003","doi-asserted-by":"crossref","unstructured":"A. Amir, Y. Aumann, G. Landau, M. Lewenstein, N. Lewenstein, Pattern matching with swaps, in: Proc. 38th IEEE FOCS, 1997, pp. 144\u2013153","DOI":"10.1109\/SFCS.1997.646103"},{"issue":"2","key":"10.1016\/j.jda.2006.10.001_bib004","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1137\/S0097539792226321","article-title":"An alphabet independent approach to two dimensional pattern matching","volume":"23","author":"Amir","year":"1994","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/j.jda.2006.10.001_bib005","unstructured":"A. Amir, K.W. Church, E. Dar, Separable attributes: a technique for solving the submatrices character count problem, in: Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2002, pp. 400\u2013401"},{"key":"10.1016\/j.jda.2006.10.001_bib006","unstructured":"A. Amir, R. Cole, R. Hariharan, M. Lewenstein, E. Porat, Overlap matching, in: Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2001, pp. 279\u2013288"},{"issue":"1","key":"10.1016\/j.jda.2006.10.001_bib007","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1995.1047","article-title":"Efficient 2-dimensional approximate matching of half-rectangular figures","volume":"118","author":"Amir","year":"1995","journal-title":"Information and Computation"},{"key":"10.1016\/j.jda.2006.10.001_bib008","series-title":"Pattern Matching Algorithms","year":"1997"},{"issue":"4","key":"10.1016\/j.jda.2006.10.001_bib009","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01215882","article-title":"Color indexing for efficient image retrieval","volume":"1","author":"Babu","year":"1995","journal-title":"Multimedia Tools and Applications"},{"key":"10.1016\/j.jda.2006.10.001_bib010","doi-asserted-by":"crossref","unstructured":"B.S. Baker, A theory of parameterized pattern matching: algorithms and applications, in: Proc. 25th Annual ACM Symposium on the Theory of Computation, 1993, pp. 71\u201380","DOI":"10.1145\/167088.167115"},{"issue":"2","key":"10.1016\/j.jda.2006.10.001_bib011","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1093\/nar\/27.2.573","article-title":"Tandem repeats finder: a program to analyze DNA sequence","volume":"27","author":"Benson","year":"1999","journal-title":"Nucleic Acids Research"},{"key":"10.1016\/j.jda.2006.10.001_bib012","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","article-title":"A fast string searching algorithm","volume":"20","author":"Boyer","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/j.jda.2006.10.001_bib013","series-title":"Combinatorial Algorithms on Words","first-page":"97","article-title":"Efficient and elegant subword tree construction","author":"Chen","year":"1985"},{"key":"10.1016\/j.jda.2006.10.001_bib014","series-title":"Text Algorithms","author":"Crochemore","year":"1994"},{"key":"10.1016\/j.jda.2006.10.001_bib015","first-page":"113","article-title":"String matching and other products","volume":"7","author":"Fischer","year":"1974","journal-title":"SIAM-AMS Proceedings"},{"issue":"3","key":"10.1016\/j.jda.2006.10.001_bib016","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1093\/llc\/13.3.111","article-title":"The evolution of stylometry in humanities scholarship","volume":"13","author":"Holmes","year":"1998","journal-title":"Literary and Linguistic Computing"},{"key":"10.1016\/j.jda.2006.10.001_bib017","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/j.jda.2006.10.001_bib018","unstructured":"S. Rao Kosaraju, Efficient string matching, Manuscript, 1987"},{"key":"10.1016\/j.jda.2006.10.001_bib019","series-title":"Proc. 6th Combinatorial Pattern Matching Conference","first-page":"298","article-title":"New results and open problems related to non-standard stringology","volume":"vol. 937","author":"Muthukrishnan","year":"1995"},{"issue":"1","key":"10.1016\/j.jda.2006.10.001_bib020","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF00130487","article-title":"Color indexing","volume":"7","author":"Swain","year":"1991","journal-title":"International Journal of Computer Vision"},{"key":"10.1016\/j.jda.2006.10.001_bib021","doi-asserted-by":"crossref","unstructured":"U. Vishkin, Optimal parallel pattern matching in strings, in: Proc. 12th ICALP, 1985, pp. 91\u2013113","DOI":"10.1016\/S0019-9958(85)80028-0"},{"key":"10.1016\/j.jda.2006.10.001_bib022","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/0220002","article-title":"Deterministic sampling\u2014a new technique for fast pattern matching","volume":"20","author":"Vishkin","year":"1991","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/j.jda.2006.10.001_bib023","doi-asserted-by":"crossref","unstructured":"P. Weiner, Linear pattern matching algorithm, in: Proc. 14 IEEE Symposium on Switching and Automata Theory, 1973, pp. 1\u201311","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Journal of Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866706000827?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866706000827?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,11]],"date-time":"2019-01-11T02:24:52Z","timestamp":1547173492000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570866706000827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["S1570866706000827"],"URL":"https:\/\/doi.org\/10.1016\/j.jda.2006.10.001","relation":{},"ISSN":["1570-8667"],"issn-type":[{"value":"1570-8667","type":"print"}],"subject":[],"published":{"date-parts":[[2007,9]]}}}