Simon's congruence pattern matching

The Simon's congruence problem is to determine whether or not two strings have the same set of subsequences of length no greater than a given integer, and the problem can be answered in linear time. We consider the Simon's congruence pattern matching problem that looks for all substrings o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science Jg. 994; S. 114478
Hauptverfasser: Kim, Sungmin, Ko, Sang-Ki, Han, Yo-Sub
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.05.2024
Schlagworte:
Data structure
Pattern matching
Simon's congruence
String algorithm
String algorithm
Simon's congruence
Data structure
Pattern matching
ISSN:0304-3975, 1879-2294
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The Simon's congruence problem is to determine whether or not two strings have the same set of subsequences of length no greater than a given integer, and the problem can be answered in linear time. We consider the Simon's congruence pattern matching problem that looks for all substrings of a text that are congruent to a pattern under the Simon's congruence. We propose a linear time algorithm by reusing results from previous computations with the help of new data structures called X-trees and Y-trees. Moreover, we investigate several variants of the problem such as identifying the shortest substring or subsequence of the text that is congruent to the pattern under the Simon's congruence, or finding frequent matchings. We design efficient algorithms for these problems. We conclude the paper with two open problems: finding the longest congruent subsequence and optimizing the pattern matching problem. •A polynomial algorithm linear in the length of the text that computes all substrings of the text that is Simon's k-congruent to the pattern.•Efficient algorithms that solve variants of the Simon's congruence pattern matching problem.•A data structure with linear preprocessing time that answers two types of queries related to Simon's congruence pattern matching multiplicities.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2024.114478