Variants of Longest Common Subsequence Problem

  • Kranthi Chandra
  • Published 2016

Abstract

Longest common subsequence is a classical problem in computer science. It is a problem of finding longest subsequence common to the given input sequences [2]. Information in various applications such as bioinformatics is expressed as sequence of characters (e.g. DNA or gene sequence). LCS is a similarity measure of these character sequences and has… (More)

Topics

18 Figures and Tables

Slides referencing similar topics