{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:35Z","timestamp":1750306955307,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,22]],"date-time":"2013-06-22T00:00:00Z","timestamp":1371859200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,22]]},"DOI":"10.1145\/2463676.2465289","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"361-372","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Improving regular-expression matching on strings using negative factors"],"prefix":"10.1145","author":[{"given":"Xiaochun","family":"Yang","sequence":"first","affiliation":[{"name":"Northeastern University, Shenyang, China"}]},{"given":"Bin","family":"Wang","sequence":"additional","affiliation":[{"name":"Northeastern University, Shenyang, China"}]},{"given":"Tao","family":"Qiu","sequence":"additional","affiliation":[{"name":"Northeastern University, Shenyang, China"}]},{"given":"Yaoshu","family":"Wang","sequence":"additional","affiliation":[{"name":"Northeastern University, Shenyang, China"}]},{"given":"Chen","family":"Li","sequence":"additional","affiliation":[{"name":"UC Irvine, Irvine, USA"}]}],"member":"320","published-online":{"date-parts":[[2013,6,22]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/235809.235810"},{"issue":"1","key":"e_1_3_2_1_2_1","first-page":"105","article-title":"The factor automaton","volume":"38","author":"Simanek M.","year":"2002","unstructured":"M. Simanek . The factor automaton . Kybernetika , 38 ( 1 ): 105 -- 111 , 2002 . M. Simanek. The factor automaton. Kybernetika, 38(1):105 -- 111, 2002.","journal-title":"Kybernetika"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1007\/BF01185427"},{"unstructured":"GNUgrep. ftp:\/\/reality.sgiweb.org\/freeware\/relnotes\/fw-5.3\/fw gnugrep\/gnugrep.html.  GNUgrep. ftp:\/\/reality.sgiweb.org\/freeware\/relnotes\/fw-5.3\/fw gnugrep\/gnugrep.html.","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_1","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft J. E.","year":"1979","unstructured":"J. E. Hopcroft and J. D. Ullman . Introduction to Automata Theory, Languages, and Computation . Addison-Wesley Publishing Company , Reading, Massachusetts , 1979 . J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, Reading, Massachusetts, 1979."},{"issue":"919","key":"e_1_3_2_1_6_1","first-page":"921","article-title":"Prosearch: Fast searching of protein sequences with regular expression patterns related to protein structure and function","volume":"13","author":"Kolakowski L. F.","year":"1992","unstructured":"L. F. Kolakowski , J. Leunissen , and J. E. Smith . Prosearch: Fast searching of protein sequences with regular expression patterns related to protein structure and function . Biotechniques , 13 : 919 -- 921 , 1992 . L. F. Kolakowski, J. Leunissen, and J. E. Smith. Prosearch: Fast searching of protein sequences with regular expression patterns related to protein structure and function. Biotechniques, 13:919 -- 921, 1992.","journal-title":"Biotechniques"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1093\/bioinformatics\/btn032"},{"issue":"2","key":"e_1_3_2_1_8_1","first-page":"217","article-title":"String matching with automata","volume":"4","author":"Mohri M.","year":"1997","unstructured":"M. Mohri . String matching with automata . Nordic Journal of Computing , 4 ( 2 ): 217 -- 231 , 1997 . M. Mohri. String matching with automata. Nordic Journal of Computing, 4(2):217 -- 231, 1997.","journal-title":"Nordic Journal of Computing"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1002\/spe.411"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/351827.384246"},{"key":"e_1_3_2_1_11_1","series-title":"Lecture Notes in Computer Science 2141","first-page":"1","volume-title":"Proceedings of WAE'01","author":"Navarro C.","year":"2001","unstructured":"C. Navarro and M. Raffinot . Compact DFA representation for fast regular expression search . In Proceedings of WAE'01 , Lecture Notes in Computer Science 2141 , pages 1 -- 12 , 2001 . C. Navarro and M. Raffinot. Compact DFA representation for fast regular expression search. In Proceedings of WAE'01, Lecture Notes in Computer Science 2141, pages 1 -- 12, 2001."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1007\/s00453-004-1120-3"},{"issue":"369","key":"e_1_3_2_1_13_1","first-page":"374","article-title":"Screening protein and nucleic acid sequences against libraries of patterns","volume":"1","author":"Staden R.","year":"1991","unstructured":"R. Staden . Screening protein and nucleic acid sequences against libraries of patterns . J. DNA Sequencing Mapping , 1 : 369 -- 374 , 1991 . R. Staden. Screening protein and nucleic acid sequences against libraries of patterns. J. DNA Sequencing Mapping, 1:369 -- 374, 1991.","journal-title":"J. DNA Sequencing Mapping"},{"key":"e_1_3_2_1_14_1","series-title":"Lecture Notes in Computer Science 1136","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/3-540-61680-2_68","volume-title":"Proceedings of the 4th Annual European Sysmposium","author":"Watson B. W.","year":"1996","unstructured":"B. W. Watson . A new regula grammar pattern matching algorithm. In Proceedings of the 4th Annual European Sysmposium , Lecture Notes in Computer Science 1136 , pages 364 -- 377 . Springer-Verlag , 1996 . B. W. Watson. A new regula grammar pattern matching algorithm. In Proceedings of the 4th Annual European Sysmposium, Lecture Notes in Computer Science 1136, pages 364 -- 377. Springer-Verlag, 1996."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/135239.135244"}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"acronym":"SIGMOD\/PODS'13","name":"SIGMOD\/PODS'13: International Conference on Management of Data","location":"New York New York USA"},"container-title":["Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2465289","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2463676.2465289","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:05Z","timestamp":1750235945000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2465289"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,22]]},"references-count":15,"alternative-id":["10.1145\/2463676.2465289","10.1145\/2463676"],"URL":"https:\/\/doi.org\/10.1145\/2463676.2465289","relation":{},"subject":[],"published":{"date-parts":[[2013,6,22]]},"assertion":[{"value":"2013-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}