Bioinformatics regularly poses new challenges to algorithm engineers and theoretical
computer scientists. This work surveys recent developments of parameterized algorithms …

Longest common subsequence problems find various applications in bioinformatics, data
compression and text editing, just to name a few. Even though numerous heuristic …

Abstract The Longest Common Subsequence (LCS) problem aims at finding a longest string
that is a subsequence of each string from a given set of input strings. This problem has …

String problems arise in various applications ranging from text mining to biological
sequence analysis. Many string problems are NP-hard. This motivates the search for (fixed …

In this paper, we generalize the inclusion constrained longest common subsequence
(CLCS) problem to the hybrid CLCS problem which is the combination of the sequence …

Longest common subsequence is a widely used measure to compare strings, in particular in
computational biology. Recently, several variants of the longest common subsequence have …

The new sequencing technologies, called next-generation sequencing, provide a huge
amount of data that can be used to reconstruct genomes. However, the methods applied to …

Computing the longest common subsequence of two sequences is one of the most studied
algorithmic problems. In this work we focus on a particular variant of the problem, called …

In this paper, we study exact, exponential-time algorithms for a variant of the classic Longest
Common Subsequence problem called the Repetition-Bounded Longest Common …

In this paper we propose a Beam-ACO approach for a combinatorial optimization problem
known as the repetition-free longest common subsequence problem. Given two input …