| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652692 | Electronic Notes in Discrete Mathematics | 2008 | 6 Pages |
Abstract
We study the problem of, given two finite sequences x and y, finding a repetition-free longest common subsequence of x and y. We show some algorithmic results, a complexity result, and a preliminary experimental study based on the proposed algorithms.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
