Rao Li

collaborators

3 papers

cs.DS2024

An Algorithm for the Longest Common Subsequence and Substring Problem for Multiple Strings

Rao Li

Let $X_{1}, X_{2}, ..., X_{s}$ and $Y_{1}, Y_{2}, ..., Y_{t}$ be strings over an alphabet $Σ$ , where $s$ and $t$ are positive integers. The longest common subsequence and substring problem for…

cs.DS2023

An Algorithm for the Constrained Longest Common Subsequence and Substring Problem

R. Li, J. Deka, K. Deka +1

Let $Σ$ be an alphabet. For two strings $X$ , $Y$ , and a constrained string $P$ over the alphabet $Σ$ , the constrained longest common subsequence and substring problem for two strin…

cs.DS2023

An Algorithm for the Longest Common Subsequence and Substring Problem

R. Li, J. Deka, K. Deka

In this note, we first introduce a new problem called the longest common subsequence and substring problem. Let $X$ and $Y$ be two strings over an alphabet $Σ$ . The longest common…