DMCA
Experimenting an Approximation Algorithm for the LCS (1998)
Cached
Download Links
- [www.statistica.unimib.it]
- [rtm.science.unitn.it]
- DBLP
Other Repositories/Bibliography
| Venue: | Discrete Applied Mathematics |
| Citations: | 10 - 0 self |
BibTeX
@ARTICLE{Bonizzoni98experimentingan,
author = {Paola Bonizzoni and Gianluca Della Vedova and Giancarlo Mauri},
title = {Experimenting an Approximation Algorithm for the LCS},
journal = {Discrete Applied Mathematics},
year = {1998},
volume = {110},
pages = {200--1}
}
Share
 |
 |
 |
 |
||
OpenURL
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.
