Article thumbnail

Experimenting an Approximation Algorithm for the LCS

By Paola Bonizzoni, Gianluca Della Vedova and Giancarlo Mauri

Abstract

The problem of finding the longest common subsequence (lcs) of a given set of sequences over an alphabet # occurs in many interesting contexts, such as data compression and molecular biology, in order to measure the "similarity degree" among biological sequences. Since the problem is NP-complete in its decision version (i.e. does there exist a lcs of length at least k, for a given k?) even over fixed alphabet, polynomial algorithms which give approximate solutions have been proposed. Among them, Long Run (LR) is the only one with guaranteed constant performance ratio

Year: 1998
OAI identifier: oai:CiteSeerX.psu:10.1.1.16.3695
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.statistica.unimib.i... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.