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.

2017

In this paper, we revisit the much studied LCS problem for two given sequences. Based on the algorithm of Iliopoulos and Rahman…

2016

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

2014

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

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…

2008

The longest common transposition-invariant subsequence (LCTS) problem is a music information retrieval oriented variation of the…

2006

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

2006

Solving the Longest Common Subsequence (LCS) Problem using the Associative ASC Processor with Reconfigurable 2D Mesh Virdi Sabegh…

2004

A moving grid method which has its origin from dierential geometry is studied. The method deforms an intial grid according to a…

2003

Pattern discovery in unaligned DNA sequences is a challenge problem. A pattern is some specific nucleotide combination that it…

1975