乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T05:43:39Z","timestamp":1736315019637,"version":"3.32.0"},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T00:00:00Z","timestamp":1736294400000},"content-version":"vor","delay-in-days":1468,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001742","name":"United States-Israel Binational Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1016\/j.tcs.2020.11.023","type":"journal-article","created":{"date-parts":[[2020,11,20]],"date-time":"2020-11-20T02:15:16Z","timestamp":1605838516000},"page":"132-137","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Towards a real time algorithm for parameterized longest common prefix computation"],"prefix":"10.1016","volume":"852","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[]},{"given":"Eitan","family":"Kondratovsky","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.tcs.2020.11.023_br0010","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1137\/S0097539702424496","article-title":"Function matching","volume":"35","author":"Amir","year":"2006","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.tcs.2020.11.023_br0020","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 J. Comput."},{"key":"10.1016\/j.tcs.2020.11.023_br0030","series-title":"Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA)","first-page":"400","article-title":"Separable attributes: a technique for solving the submatrices character count problem","author":"Amir","year":"2002"},{"key":"10.1016\/j.tcs.2020.11.023_br0040","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0020-0190(94)90086-8","article-title":"Alphabet dependence in parameterized matching","volume":"49","author":"Amir","year":"1994","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"10.1016\/j.tcs.2020.11.023_br0050","doi-asserted-by":"crossref","first-page":"1396","DOI":"10.1137\/110836377","article-title":"Managing unbounded-length keys in comparison-driven data structures with applications to online indexing","volume":"43","author":"Amir","year":"2014","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2020.11.023_br0060","series-title":"Proc. 12th Symposium on String Processing and Information Retrieval (SPIRE)","first-page":"67","article-title":"Towards real-time suffix tree construction","volume":"vol. 3772","author":"Amir","year":"2005"},{"key":"10.1016\/j.tcs.2020.11.023_br0070","series-title":"Proc. 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","first-page":"1086","article-title":"Real-time indexing over fixed finite alphabets","author":"Amir","year":"2008"},{"issue":"1","key":"10.1016\/j.tcs.2020.11.023_br0080","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.jda.2006.03.014","article-title":"Parameterized matching with mismatches","volume":"5","author":"Apostolico","year":"2007","journal-title":"J. Discret. Algorithms"},{"issue":"4","key":"10.1016\/j.tcs.2020.11.023_br0090","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":"Multimed. Tools Appl."},{"issue":"1","key":"10.1016\/j.tcs.2020.11.023_br0100","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1006\/jcss.1996.0003","article-title":"Parameterized pattern matching: algorithms and applications","volume":"52","author":"Baker","year":"1996","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"10.1016\/j.tcs.2020.11.023_br0110","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1137\/S0097539793246707","article-title":"Parameterized duplication in strings: algorithms and an application to software maintenance","volume":"26","author":"Baker","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2020.11.023_br0120","series-title":"Proc. 22nd Annual Symposium on Combinatorial Pattern Matching (CPM)","first-page":"162","article-title":"Real-time streaming string-matching","author":"Breslauer","year":"2011"},{"key":"10.1016\/j.tcs.2020.11.023_br0130","series-title":"Proc. 19th ACM Symposium on Theory of Computing (STOC)","first-page":"365","article-title":"Two algorithms for maintaining order in a list","author":"Dietz","year":"1987"},{"key":"10.1016\/j.tcs.2020.11.023_br0140","series-title":"Proc. 38th IEEE Symposium on Foundations of Computer Science","first-page":"137","article-title":"Optimal suffix tree construction with large alphabets","author":"Farach","year":"1997"},{"key":"10.1016\/j.tcs.2020.11.023_br0150","series-title":"Proc. 12th Annual European Symposium on Algorithms (ESA 2004)","first-page":"414","article-title":"Approximate parameterized matching","author":"Hazay","year":"2004"},{"issue":"2","key":"10.1016\/j.tcs.2020.11.023_br0160","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00288968","article-title":"A new data structure for representing sorted lists","volume":"17","author":"Huddleston","year":"1982","journal-title":"Acta Inform."},{"key":"10.1016\/j.tcs.2020.11.023_br0170","series-title":"Proc. 5th Combinatorial Pattern Matching (CPM)","first-page":"226","article-title":"Multiple matching of parameterized patterns","volume":"vol. 807","author":"Idury","year":"1994"},{"key":"10.1016\/j.tcs.2020.11.023_br0180","series-title":"Proc. 26th STOC","first-page":"310","article-title":"Real-time pattern matching and quasi-real-time construction of suffix trees","author":"Kosaraju","year":"1994"},{"author":"Kucherov","key":"10.1016\/j.tcs.2020.11.023_br0190"},{"key":"10.1016\/j.tcs.2020.11.023_br0200","series-title":"Proc. 16th Symposium on String Processing and Information Retrieval (SPIRE)","first-page":"31","article-title":"On-line construction of parameterized suffix trees","volume":"vol. 5721","author":"Lee","year":"2009"},{"key":"10.1016\/j.tcs.2020.11.023_br0210","series-title":"Proc. 1st ACM-SIAM Symp. on Discrete Algorithms (SODA)","first-page":"319","article-title":"Suffix arrays: a new method for on-line string searches","author":"Manber","year":"1990"},{"key":"10.1016\/j.tcs.2020.11.023_br0220","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economical suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.tcs.2020.11.023_br0230","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0202005","article-title":"Binary search trees of bounded balance","volume":"2","author":"Nievergelt","year":"1973","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/j.tcs.2020.11.023_br0240","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1007\/BF01940876","article-title":"Randomized search trees","volume":"16","author":"Seidel","year":"1996","journal-title":"Algorithmica"},{"issue":"3","key":"10.1016\/j.tcs.2020.11.023_br0250","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","article-title":"Self-adjusting binary search trees","volume":"32","author":"Sleator","year":"1985","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.tcs.2020.11.023_br0260","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF00130487","article-title":"Color indexing","volume":"7","author":"Swain","year":"1991","journal-title":"Int. J. Comput. Vis."},{"year":"1983","series-title":"Data Structures and Network Algorithms","author":"Tarjan","key":"10.1016\/j.tcs.2020.11.023_br0270"},{"key":"10.1016\/j.tcs.2020.11.023_br0280","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00289142","article-title":"Maintaining order in a generalized linked list","volume":"21","author":"Tsakalidis","year":"1984","journal-title":"Acta Inform."},{"key":"10.1016\/j.tcs.2020.11.023_br0290","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01206331","article-title":"On-line construction of suffix trees","volume":"14","author":"Ukkonen","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2020.11.023_br0300","series-title":"Proc. 14 IEEE Symposium on Switching and Automata Theory","first-page":"1","article-title":"Linear pattern matching algorithm","author":"Weiner","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397520306642?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397520306642?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T02:23:02Z","timestamp":1736302982000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397520306642"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":30,"alternative-id":["S0304397520306642"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2020.11.023","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Towards a real time algorithm for parameterized longest common prefix computation","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2020.11.023","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}