Sign Up to like & get
recommendations!
1
Published in 2021 at "Algorithms"
DOI: 10.3390/a14050133
Abstract: Finding substrings of a text T that match a regular expression p is a fundamental problem. Despite being the subject of extensive research, no solution with a time complexity significantly better than O(|T||p|) has been…
read more here.
Keywords:
regular expression;
preprocessing time;
matrix;
time ... See more keywords