Longest common subsequence problem

Known as: LCS problem, Longest-common subsequence problem, Difference Algorithm

The longest common subsequence (LCS) problem is the problem of finding the longest subsequence common to all sequences in a set of sequences (often…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

Given a combinatorial optimization problem (COP) solved by a dynamic programming algorithm (DPA), we address the design of a…

2015

The allocation of resources in cloud computing has always been the focus of research, and as for how to improve the…

2014

Given two sequences, the traditional longest common subsequence (LCS) problem is to obtain the common subsequence with the…

2012

In this paper, we present a new and efficient algorithm for solving the longest common subsequence problem between two run-length…

2011

The longest common subsequence (LCS) problem with gap constraints (or the gapped LCS), which has applications to genetics and…

2009

Let X and Y be two finite strings over a finite alphabet Σ. A common subsequence of X and Y is a subsequence which is a…

2009

The k-LCS (longest common subsequence) problem is to find the LCS of k sequences. The k-LCS is difficult while the length and the…

2006

There is disclosed herein a gauge for aligning opposite points within opposite surfaces of a normally symmetric body. The gauge…

2002

A longest common subsequence (LCS) of two strings is a common subsequence of two strings of maximal length. The LCS problem is…

1975