The 2-LCPS problem, first introduced by Chowdhury et al.(2014)[17], asks one to compute
(the length of) a longest common palindromic subsequence between two given strings A …

A square is a non-empty string of form YY. The longest common square subsequence
(LCSqS) problem is to compute a longest square occurring as a subsequence in two given …

Given two sequences S1, S2, and a constrained sequence C, a longest common
subsequence of S1, S2 with restriction to C is called a constrained longest common …

The constrained LCS (CLCS) problem, a recent variant of the longest common subsequence
(LCS) problem, has gained much attention. Given two sequences X and Y of lengths n and …

Disclosed herein are techniques related to automated generation of regular expressions. In
some embodiments, a regular expression generator may receive input data comprising one …

This data onboarding often presents challenges for cloud-based data repositories and other
big data systems, where data from various different data sources and/or data streams may …

We consider labeled directed graphs where each vertex is labeled with a non-empty string.
Such labeled graphs are also known as non-linear texts in the literature. In this paper, we …

Techniques for generated regular expressions are disclosed. In some embodiments, a
regular expression generator may receive input data comprising one or more character …

Imposing constraints in the form of a finite automaton or a regular expression is an effective
way to incorporate additional a priori knowledge into sequence alignment procedures. With …

Disclosed herein are techniques related to automated gen eration of regular expressions. In
some embodiments, a regular expression generator may receive input data com prising one …