Negative Factor: Improving Regular-Expression Matching in Strings
The problem of finding matches of a regular expression (RE) on a string exists in many applications such as text editing, biosequence search, and shell commands. Existing techniques first identify candidates using substrings in the RE, then verify each of them using an automaton. These techniques be...
Saved in:
Main Authors: | YANG, Xiaochun, QIU, Tao, WANG, Bin, ZHENG, Baihua, WANG, Yaoshu, LI, Chen |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2016
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/3157 https://ink.library.smu.edu.sg/context/sis_research/article/4157/viewcontent/P_ID_51559_NegativeFactor_2015_afv.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Approximate matching of complex structures
by: RAJIV PANICKER
Published: (2010) -
Reducibilities between Regular Languages
by: TAN WAI YEAN
Published: (2011) -
A STUDY OF RANDOMNESS AND GROUPS USING FINITE AUTOMATA
by: MOLDAGALIYEV BIRZHAN
Published: (2018) -
XHaskell - Adding regular expression types to haskell
by: LU ZHUO MING
Published: (2010) -
Regular patterns, regular languages and context-free languages
by: Jain, S., et al.
Published: (2013)