
Small Longest Tandem Scattered Subsequences
We consider the problem of identifying tandem scattered subsequences wit...
read it

String Sanitization: A Combinatorial Approach
String data are often disseminated to support applications such as locat...
read it

Separating Sets of Strings by Finding Matching Patterns is Almost Always Hard
We study the complexity of the problem of searching for a set of pattern...
read it

The Parameterized Position Heap of a Trie
Let Σ and Π be disjoint alphabets of respective size σ and π. Two string...
read it

Classical and Quantum Algorithms for Constructing Text from Dictionary Problem
We study algorithms for solving the problem of constructing a text (long...
read it

Faster Binary Mean Computation Under Dynamic Time Warping
Many consensus string problems are based on Hamming distance. We replace...
read it

The Capacity of Some Pólya String Models
We study random stringduplication systems, which we call Pólya string m...
read it
Pattern Discovery in Colored Strings
We consider the problem of identifying patterns of interest in colored strings. A colored string is a string in which each position is colored with one of a finite set of colors. Our task is to find substrings that always occur followed by the same color at the same distance. The problem is motivated by applications in embedded systems verification, in particular, assertion mining. The goal there is to automatically infer properties of the embedded system from the analysis of its simulation traces. We show that the number of interesting patterns is upperbounded by O(n^2) where n is the length of the string. We introduce a baseline algorithm with O(n^2) running time which identifies all interesting patterns for all colors in the string satisfying certain minimality conditions. When one is interested in patterns related to only one color, we provide an algorithm that identifies patterns in O(n^2log n) time, but is faster than the first algorithm in practice, both on simulated and on realworld patterns.
READ FULL TEXT
Comments
There are no comments yet.