TY - GEN

T1 - Online recognition of dictionary with one gap

AU - Amir, Amihood

AU - Levy, Avivit

AU - Porat, Ely

AU - Riva Shalom, B.

N1 - Publisher Copyright: © Czech Technical University in Prague, Czech Republic.

PY - 2017

Y1 - 2017

N2 - We formalize and examine the online Dictionary Recognition with One Gap problem (DROG) which is the following. Preprocess a dictionary D of d patterns, where each pattern contains a special gap symbol that can match any string, so that given a text that arrives online, a character at a time, we can report all the patterns from D that have not been reported yet and are suffixes of the text that has arrived so far, before the next character arrives. The gap symbols are associated with bounds determining the possible lengths of matching strings. Online DROG captures the difficulty in a bottleneck procedure for cyber-security, as many digital signatures of viruses manifest themselves as patterns with a single gap. Following the work of [4] on the closely related online Dictionary Matching with One Gap problem (DMOG), we provide algorithms whose time cost depends linearly on δ(GD), where GD is a bipartite graph that captures the structure of D and δ(GD) is the degeneracy of this graph. These algorithms are of practical interest since although δ(GD) can be as large as √d, and even larger if GD is a multi-graph, it is typically a very small constant in practice. Finally, when δ(GD) is large we describe other efficient solutions.

AB - We formalize and examine the online Dictionary Recognition with One Gap problem (DROG) which is the following. Preprocess a dictionary D of d patterns, where each pattern contains a special gap symbol that can match any string, so that given a text that arrives online, a character at a time, we can report all the patterns from D that have not been reported yet and are suffixes of the text that has arrived so far, before the next character arrives. The gap symbols are associated with bounds determining the possible lengths of matching strings. Online DROG captures the difficulty in a bottleneck procedure for cyber-security, as many digital signatures of viruses manifest themselves as patterns with a single gap. Following the work of [4] on the closely related online Dictionary Matching with One Gap problem (DMOG), we provide algorithms whose time cost depends linearly on δ(GD), where GD is a bipartite graph that captures the structure of D and δ(GD) is the degeneracy of this graph. These algorithms are of practical interest since although δ(GD) can be as large as √d, and even larger if GD is a multi-graph, it is typically a very small constant in practice. Finally, when δ(GD) is large we describe other efficient solutions.

UR - http://www.scopus.com/inward/record.url?scp=85086071314&partnerID=8YFLogxK

M3 - منشور من مؤتمر

T3 - Proceedings of the Prague Stringology Conference, PSC 2017

SP - 3

EP - 17

BT - Proceedings of the Prague Stringology Conference, PSC 2017

A2 - Holub, Jan

A2 - Zdarek, Jan

T2 - 21st Prague Stringology Conference, PSC 2017

Y2 - 28 August 2017 through 30 August 2017

ER -