乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T08:10:16Z","timestamp":1726906216425},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T00:00:00Z","timestamp":1648598400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T00:00:00Z","timestamp":1648598400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100008393","name":"Teknologi og Produktion, Det Frie Forskningsr\u00e5d","doi-asserted-by":"crossref","award":["4005-00267"],"id":[{"id":"10.13039\/100008393","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100008394","name":"Natur og Univers, Det Frie Forskningsr\u00e5d","doi-asserted-by":"crossref","award":["1323-00178"],"id":[{"id":"10.13039\/100008394","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s00236-022-00420-6","type":"journal-article","created":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T11:02:38Z","timestamp":1648638158000},"page":"709-724","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["From regular expression matching to parsing"],"prefix":"10.1007","volume":"59","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-1120-5154","authenticated-orcid":false,"given":"Philip","family":"Bille","sequence":"first","affiliation":[]},{"given":"Inge Li","family":"G\u00f8rtz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,30]]},"reference":[{"volume-title":"Compilers: Principles, Techniques, and Tools","year":"1986","author":"AV Aho","key":"420_CR1","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools. Addison-Wesley Longman Publishing Co., Inc., Boston (1986)"},{"key":"420_CR2","doi-asserted-by":"crossref","unstructured":"Backurs, A., Indyk, P.: Which regular expression patterns are hard to match?. In: Proc. 57th FOCS, pp. 457\u2013466 (2016)","DOI":"10.1109\/FOCS.2016.56"},{"key":"420_CR3","doi-asserted-by":"crossref","unstructured":"Bille, P.: New algorithms for regular expression matching. In: Proc. of the 33rd ICALP, pp. 643\u2013654 (2006)","DOI":"10.1007\/11786986_56"},{"issue":"3","key":"420_CR4","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1016\/j.tcs.2008.08.042","volume":"409","author":"P Bille","year":"2008","unstructured":"Bille, P., Farach-Colton, M.: Fast and compact regular expression matching. Theor. Comput. Sci. 409(3), 486\u2013496 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"420_CR5","unstructured":"Bille, P., G\u00f8rtz, I.L.: From regular expression matching to parsing. In: Proc. 44th MFCS (2019)"},{"key":"420_CR6","doi-asserted-by":"crossref","unstructured":"Bille, P., Thorup, M.: Faster regular expression matching. In: Proc. 36th ICALP, pp. 171\u2013182 (2009). Full version with appendix available at http:\/\/www2.compute.dtu.dk\/~phbi\/files\/publications\/2009fremC.pdf","DOI":"10.1007\/978-3-642-02927-1_16"},{"key":"420_CR7","doi-asserted-by":"crossref","unstructured":"Bille, P., Thorup, M.: Regular expression matching with multi-strings and intervals. In: Proc. 21st SODA, pp. 1297\u20131308 (2010)","DOI":"10.1137\/1.9781611973075.104"},{"issue":"2","key":"420_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s002360000037","volume":"37","author":"D Dub\u00e9","year":"2000","unstructured":"Dub\u00e9, D., Feeley, M.: Efficiently building a parse tree from a regular expression. Acta Inform. 37(2), 121\u2013144 (2000)","journal-title":"Acta Inform."},{"issue":"3","key":"420_CR9","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0022-0000(05)80064-9","volume":"48","author":"ML Fredman","year":"1994","unstructured":"Fredman, M.L., Willard, D.E.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. Syst. Sci. 48(3), 533\u2013551 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"420_CR10","doi-asserted-by":"crossref","unstructured":"Frisch, A., Cardelli, L.: Greedy regular expression matching. In: Proc. 31st ICALP, vol. 3142, pp. 618\u2013629 (2004)","DOI":"10.1007\/978-3-540-27836-8_53"},{"key":"420_CR11","unstructured":"Garofalakis, M.N., Rastogi, R., Shim, K.: SPIRIT: sequential pattern mining with regular expression constraints. In: Proc. 25th VLDB, pp. 223\u2013234 (1999)"},{"issue":"5","key":"420_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"VM Glushkov","year":"1961","unstructured":"Glushkov, V.M.: The abstract theory of automata. Russ. Math. Surv. 16(5), 1\u201353 (1961)","journal-title":"Russ. Math. Surv."},{"issue":"6","key":"420_CR13","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"DS Hirschberg","year":"1975","unstructured":"Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Commun. ACM 18(6), 341\u2013343 (1975)","journal-title":"Commun. ACM"},{"key":"420_CR14","doi-asserted-by":"crossref","unstructured":"Johnson, T., Muthukrishnan, S., Rozenbaum, I.: Monitoring regular expressions on out-of-order streams. In: Proc. 23nd ICDE, pp. 1315\u20131319 (2007)","DOI":"10.1109\/ICDE.2007.369001"},{"key":"420_CR15","first-page":"185","volume":"70","author":"C Jordan","year":"1869","unstructured":"Jordan, C.: Sur les assemblages des lignes. J. Reine Angew. Math. 70, 185\u2013190 (1869)","journal-title":"J. Reine Angew. Math."},{"issue":"8","key":"420_CR16","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1002\/spe.4380210803","volume":"21","author":"SM Kearns","year":"1991","unstructured":"Kearns, S.M.: Extending regular expressions with context operators and parse extraction. Softw. Pract. Exp. 21(8), 787\u2013804 (1991)","journal-title":"Softw. Pract. Exp."},{"key":"420_CR17","doi-asserted-by":"crossref","unstructured":"Kin, K., Hartmann, B., DeRose, T., Agrawala, M.: Proton: multitouch gestures as regular expressions. In: Proc. SIGCHI, pp. 2885\u20132894 (2012)","DOI":"10.1145\/2207676.2208694"},{"key":"420_CR18","doi-asserted-by":"crossref","unstructured":"Kumar, S., Dharmapurikar, S., Yu, F., Crowley, P., Turner, J.: Algorithms to accelerate multiple regular expressions matching for deep packet inspection. In: Proc. SIGCOMM, pp. 339\u2013350 (2006)","DOI":"10.1145\/1151659.1159952"},{"key":"420_CR19","doi-asserted-by":"crossref","unstructured":"Laurikari, V.: NFAs with tagged transitions, their conversion to deterministic automata and application to regular expressions. In: Proc. 7th SPIRE, pp. 181\u2013187 (2000)","DOI":"10.1109\/SPIRE.2000.878194"},{"key":"420_CR20","unstructured":"Li, Q., Moon, B.: Indexing and querying XML data for regular path expressions. In: Proc. 27th VLDB, pp. 361\u2013370 (2001)"},{"issue":"1","key":"420_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"9","author":"R McNaughton","year":"1960","unstructured":"McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IRE Trans. Electron. Comput. 9(1), 39\u201347 (1960)","journal-title":"IRE Trans. Electron. Comput."},{"key":"420_CR22","doi-asserted-by":"crossref","unstructured":"Murata, M.: Extended path expressions of XML. In: Proc. 20th PODS, pp. 126\u2013137 (2001)","DOI":"10.1145\/375551.375569"},{"issue":"2","key":"420_CR23","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1145\/128749.128755","volume":"39","author":"EW Myers","year":"1992","unstructured":"Myers, E.W.: A four-Russian algorithm for regular expression pattern matching. J. ACM 39(2), 430\u2013448 (1992)","journal-title":"J. ACM"},{"issue":"6","key":"420_CR24","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1089\/106652703322756140","volume":"10","author":"G Navarro","year":"2003","unstructured":"Navarro, G., Raffinot, M.: Fast and simple character classes and bounded gaps pattern matching, with applications to protein searching. J. Comput. Biol. 10(6), 903\u2013923 (2003)","journal-title":"J. Comput. Biol."},{"key":"420_CR25","doi-asserted-by":"crossref","unstructured":"Nielsen, L., Henglein, F.: Bit-coded regular expression parsing. In: Proc. 5th LATA, pp. 402\u2013413 (2011)","DOI":"10.1007\/978-3-642-21254-3_32"},{"key":"420_CR26","doi-asserted-by":"crossref","unstructured":"Sulzmann, M., Lu, K. Z. M.: Regular expression sub-matching using partial derivatives. In: Proc. 14th PPDP, pp. 79\u201390 (2012)","DOI":"10.1145\/2370776.2370788"},{"key":"420_CR27","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K Thompson","year":"1968","unstructured":"Thompson, K.: Regular expression search algorithm. Commun. ACM 11, 419\u2013422 (1968)","journal-title":"Commun. ACM"},{"key":"420_CR28","doi-asserted-by":"crossref","unstructured":"Yu, F., Chen, Z., Diao, Y., Lakshman, T. V.: Katz, R. H.: Fast and memory-efficient regular expression matching for deep packet inspection. In: Proc. ANCS, pp. 93\u2013102 (2006)","DOI":"10.1145\/1185347.1185360"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-022-00420-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-022-00420-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-022-00420-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T07:50:30Z","timestamp":1726905030000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-022-00420-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,30]]},"references-count":28,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["420"],"URL":"https:\/\/doi.org\/10.1007\/s00236-022-00420-6","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2022,3,30]]},"assertion":[{"value":"29 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}