Finding the longest common subsequence (LCS) of multiple strings is an NP-hard problem,
with many applications in the areas of bioinformatics and computational genomics. Although …

Background Searching for the longest common sequence (LCS) of multiple biosequences is
one of the most fundamental tasks in bioinformatics. In this paper, we present a parallel …

Let X and Y be two strings of lengths n and m, respectively, and k and l, respectively, be the
numbers of runs in their corresponding run-length encoded forms. We propose a simple …

We study sketching and streaming algorithms for the Longest Common Subsequence
problem (LCS) on strings of small alphabet size $|\Sigma| $. For the problem of deciding …

A variant of the Longest Common Subsequence (LCS) problem is the LCS problem with
multiple substring-exclusion constraints (M-STR-EC-LCS), which has great importance in …

The multiple longest common subsequence (MLCS) problem, which is related to the
measurement of sequence similarity, is one of the fundamental problems in many fields. As …

In this paper, we focus on the edit distance between two given strings where block-edit
operations are allowed and better fitting to the human natural edit behaviors. Previous …

This paper proposes a class of string kernels that can handle a variety of subsequence-
based features. Slight adaptations of the basic algorithm allow for weighing subsequence …

In this paper, we study the sequential substring constrained longest common subsequence
(SSCLCS) problem. It is widely used in the bioinformatics field. Given two strings X and Y …

The longest common subsequence (LCS) problem is a classic and well-studied problem in
computer science with extensive applications in diverse areas ranging from spelling error …