乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T03:42:00Z","timestamp":1677728520451},"reference-count":25,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3124,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2005,2]]},"DOI":"10.1016\/j.tcs.2004.12.002","type":"journal-article","created":{"date-parts":[[2004,12,30]],"date-time":"2004-12-30T00:16:50Z","timestamp":1104365810000},"page":"391-404","source":"Crossref","is-referenced-by-count":13,"title":["The wide window string matching algorithm"],"prefix":"10.1016","volume":"332","author":[{"given":"Longtao","family":"He","sequence":"first","affiliation":[]},{"given":"Binxing","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Sui","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.tcs.2004.12.002_bib1","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1006\/jagm.2000.1087","article-title":"Simple optimal string matching algorithm","volume":"36","author":"Allauzen","year":"2000","journal-title":"J. Algorithms"},{"issue":"10","key":"10.1016\/j.tcs.2004.12.002_bib2","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/135239.135243","article-title":"A new approach to text searching","volume":"35","author":"Baeza-Yates","year":"1992","journal-title":"Comm. ACM"},{"issue":"10","key":"10.1016\/j.tcs.2004.12.002_bib3","doi-asserted-by":"crossref","first-page":"62","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.tcs.2004.12.002_bib4","series-title":"Handbook of Exact String Matching Algorithms","author":"Charras","year":"2004"},{"key":"10.1016\/j.tcs.2004.12.002_bib5","doi-asserted-by":"crossref","unstructured":"C. Charras, T. Lecroq, J.D. Pehoushek, A very fast string matching algorithm for small alphabets and long patterns, in: M. Farach-Colton (Ed.), Proc. of the 9th Ann. Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science, Vol. 1448, Springer, Piscataway, NJ, USA, 1998, pp. 55\u201364.","DOI":"10.1007\/BFb0030780"},{"issue":"1","key":"10.1016\/j.tcs.2004.12.002_bib6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(86)90041-1","article-title":"Transducers and repetitions","volume":"45","author":"Crochemore","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2004.12.002_bib7","series-title":"Pattern Matching Algorithms","first-page":"1","article-title":"Off-line serial exact string searching","author":"Crochemore","year":"1997"},{"issue":"1","key":"10.1016\/j.tcs.2004.12.002_bib8","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0304-3975(01)00222-5","article-title":"Reducing space for index implementation","volume":"292","author":"Crochemore","year":"2003","journal-title":"Theoret. Comput. Sci."},{"issue":"4\/5","key":"10.1016\/j.tcs.2004.12.002_bib9","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01185427","article-title":"Speeding up two string-matching algorithms","volume":"12","author":"Crochemore","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2004.12.002_bib10","doi-asserted-by":"crossref","unstructured":"M. Crochemore, C. Hancart, Automata for matching patterns, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 2, Linear Modeling: Background and Application, Springer, Berlin, 1997, pp. 399\u2013462 (Chapter 9).","DOI":"10.1007\/978-3-662-07675-0_9"},{"key":"10.1016\/j.tcs.2004.12.002_bib11","unstructured":"M. Crochemore, W. Rytter, Text algorithms, Oxford University Press, Oxford, 1994, 412pp."},{"key":"10.1016\/j.tcs.2004.12.002_bib12","series-title":"Jewels of Stringology","author":"Crochemore","year":"2002"},{"key":"10.1016\/j.tcs.2004.12.002_bib13","doi-asserted-by":"crossref","unstructured":"L. He, B. Fang, Linear nondeterministic dawg string matching algorithm, in: A. Alberto, M. Massimo (Eds.), String Processing and Information Retrieval, 11th Internat. Symp. (SPIRE 2004), Lecture Notes in Computer Science, Vol. 3246, Springer, Padova, Italy, 2004, pp. 70\u201371.","DOI":"10.1007\/978-3-540-30213-1_8"},{"issue":"11","key":"10.1016\/j.tcs.2004.12.002_bib14","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1002\/spe.4380211105","article-title":"Fast string searching","volume":"21","author":"Hume","year":"1991","journal-title":"Software Pract. Exper."},{"issue":"2","key":"10.1016\/j.tcs.2004.12.002_bib15","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 J. Comput."},{"issue":"1","key":"10.1016\/j.tcs.2004.12.002_bib16","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0304-3975(92)90139-7","article-title":"A variation on the Boyer\u2013Moore algorithm","volume":"92","author":"Lecroq","year":"1992","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2004.12.002_bib17","first-page":"1","article-title":"Fast and flexible string matching by combining bit-parallelism and suffix automata","volume":"5","author":"Navarro","year":"2000","journal-title":"ACM J. Exp. Algorithmics (JEA)"},{"key":"10.1016\/j.tcs.2004.12.002_bib18","series-title":"Flexible Pattern Matching in Strings\u2014Practical On-line Search Algorithms for Texts and Biological Sequences","author":"Navarro","year":"2002"},{"key":"10.1016\/j.tcs.2004.12.002_bib19","doi-asserted-by":"crossref","unstructured":"H. Peltola, J. Tarhio, Alternative algorithms for bit-parallel string matching, in: M.A. Nascimento, E.S. de Moura, A.L. Oliveira (Eds.), Proc. 10th Internat. Symp. on String Processing and Information Retrieval (SPIRE\u201903), Lecture Notes in Computer Science, Vol. 2857, Springer, Manaus, Brazil, 2003, pp. 80\u201394.","DOI":"10.1007\/978-3-540-39984-1_7"},{"key":"10.1016\/j.tcs.2004.12.002_bib20","series-title":"Proc. 4th South American Workshop on String Processing","first-page":"140","article-title":"Asymptotic estimation of the average number of terminal states in dawgs","author":"Raffinot","year":"1997"},{"key":"10.1016\/j.tcs.2004.12.002_bib21","series-title":"Proc. 4th South American Workshop on String Processing","first-page":"149","article-title":"On the multi backward dawg matching algorithm (MultiBDM)","author":"Raffinot","year":"1997"},{"key":"10.1016\/j.tcs.2004.12.002_bib22","series-title":"Computing Patterns in Strings","author":"Smyth","year":"2003"},{"issue":"8","key":"10.1016\/j.tcs.2004.12.002_bib23","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/79173.79184","article-title":"A very fast substring search algorithm","volume":"33","author":"Sunday","year":"1990","journal-title":"Comm. ACM"},{"key":"10.1016\/j.tcs.2004.12.002_bib24","unstructured":"T.-H. Tsai, Average case analysis of the boyer\u2013moore algorithm, in: http:\/\/www.stat.sinica.edu.tw\/chonghi\/stat.htm, 2003."},{"issue":"3","key":"10.1016\/j.tcs.2004.12.002_bib25","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1137\/0208029","article-title":"The complexity of pattern matching for a random string","volume":"8","author":"Yao","year":"1979","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397504007881?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397504007881?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T14:22:51Z","timestamp":1548858171000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397504007881"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":25,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2005,2]]}},"alternative-id":["S0304397504007881"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2004.12.002","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}