Cargando…
Exploring efficient grouping algorithms in regular expression matching
BACKGROUND: Regular expression matching (REM) is widely employed as the major tool for deep packet inspection (DPI) applications. For automatic processing, the regular expression patterns need to be converted to a deterministic finite automata (DFA). However, with the ever-increasing scale and compl...
Autores principales: | Xu, Chengcheng, Su, Jinshu, Chen, Shuhui |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6200238/ https://www.ncbi.nlm.nih.gov/pubmed/30356262 http://dx.doi.org/10.1371/journal.pone.0206068 |
Ejemplares similares
-
Offset-FA: A Uniform Method to Handle Both Unbounded and Bounded Repetitions in Regular Expression Matching
por: Xu, Chengcheng, et al.
Publicado: (2022) -
Regular expression order-sorted unification and matching
por: Kutsia, Temur, et al.
Publicado: (2015) -
Deafness mutation mining using regular expression based pattern matching
por: Frenz, Christopher M
Publicado: (2007) -
Algorithms for Hidden Markov Models Restricted to Occurrences of Regular Expressions
por: Tataru, Paula, et al.
Publicado: (2013) -
Reusable, set-based selection algorithm for matched control groups
por: Thayer, Daniel, et al.
Publicado: (2017)