DeepAI AI Chat
Log In Sign Up

A Data-Structure for Approximate Longest Common Subsequence of A Set of Strings

by   Sepideh Aghamolaei, et al.
Sharif Accelerator

Given a set of k strings I, their longest common subsequence (LCS) is the string with the maximum length that is a subset of all the strings in I. A data-structure for this problem preprocesses I into a data-structure such that the LCS of a set of query strings Q with the strings of I can be computed faster. Since the problem is NP-hard for arbitrary k, we allow an error that allows some characters to be replaced by other characters. We define the approximation version of the problem with an extra input m, which is the length of the regular expression (regex) that describes the input, and the approximation factor is the logarithm of the number of possibilities in the regex returned by the algorithm, divided by the logarithm regex with the minimum number of possibilities.


page 1

page 2

page 3

page 4


Fast entropy-bounded string dictionary look-up with mismatches

We revisit the fundamental problem of dictionary look-up with mismatches...

SafeStrings: Representing Strings as Structured Data

Strings are ubiquitous in code. Not all strings are created equal, some ...

Dynamic Packed Compact Tries Revisited

Given a dynamic set K of k strings of total length n whose characters ar...

Engineering Rank/Select Data Structures for Big-Alphabet Strings

Big-alphabet strings are common in several scenarios such as information...

Longest Property-Preserved Common Factor

In this paper we introduce a new family of string processing problems. W...

Pattern Masking for Dictionary Matching

In the Pattern Masking for Dictionary Matching (PMDM) problem, we are gi...