Solving longest common subsequence problems via a transformation to the maximum clique problem
Longest common subsequence problems find various applications in bioinformatics, data
compression and text editing, just to name a few. Even though numerous heuristic …
compression and text editing, just to name a few. Even though numerous heuristic …
Average sensitivity of dynamic programming
S Kumabe, Y Yoshida - Proceedings of the 2022 Annual ACM-SIAM …, 2022 - SIAM
When processing data with uncertainty, it is desirable that the output of the algorithm is
stable against small perturbations in the input. Varma and Yoshida [SODA'21] recently …
stable against small perturbations in the input. Varma and Yoshida [SODA'21] recently …
A biased random key genetic algorithm for solving the longest common square subsequence problem
This paper considers the longest common square subsequence (LCSqS) problem, a variant
of the longest common subsequence (LCS) problem in which solutions must be square …
of the longest common subsequence (LCS) problem in which solutions must be square …
Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences
We consider the constrained longest common subsequence problem with an arbitrary set of
input strings as well as an arbitrary set of pattern strings. This problem has applications, for …
input strings as well as an arbitrary set of pattern strings. This problem has applications, for …
Solving the longest common subsequence problem concerning non-uniform distributions of letters in input strings
The longest common subsequence (LCS) problem is a prominent NP–hard optimization
problem where, given an arbitrary set of input strings, the aim is to find a longest …
problem where, given an arbitrary set of input strings, the aim is to find a longest …
A hardness result and new algorithm for the longest common palindromic subsequence problem
S Inenaga, H Hyyrö - Information Processing Letters, 2018 - Elsevier
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 …
(the length of) a longest common palindromic subsequence between two given strings A …
Computing longest common square subsequences
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 …
(LCSqS) problem is to compute a longest square occurring as a subsequence in two given …
Anytime algorithms for the longest common palindromic subsequence problem
The longest common palindromic subsequence (LCPS) problem aims at finding a longest
string that appears as a subsequence in each of a set of input strings and is a palindrome at …
string that appears as a subsequence in each of a set of input strings and is a palindrome at …
An A⁎ search algorithm for the constrained longest common subsequence problem
The constrained longest common subsequence (CLCS) problem was introduced as a
specific measure of similarity between molecules. It is a special case of the constrained …
specific measure of similarity between molecules. It is a special case of the constrained …
Longest common rollercoasters
For an integer k ≥ 3 k≥ 3, ak-rollercoaster is a numeric string such that any maximal strictly
non-increasing or non-decreasing substring has length at least k. We consider the problem …
non-increasing or non-decreasing substring has length at least k. We consider the problem …