Skip to Main content Skip to Navigation
Journal articles

Repetition-free longest common subsequence

Abstract : We study the following problem. Given two sequences x and y over a finite alphabet, find a repetition-free longest common subsequence of x and y. We show several algorithmic results, a computational complexity result, and we describe a preliminary experimental study based on the proposed algorithms. We also show that this problem is APX-hard.
Document type :
Journal articles
Complete list of metadata
Contributor : Stéphane Delmotte Connect in order to contact the contributor
Submitted on : Wednesday, November 24, 2010 - 2:43:03 PM
Last modification on : Monday, April 25, 2022 - 5:23:12 PM

Links full text




S.S Adi, M. Braga, C.G. Fernandes, C.E. Ferreira, F.V. Martinez, et al.. Repetition-free longest common subsequence. Discrete Applied Mathematics, Elsevier, 2010, 158 (12), pp.1315-1324. ⟨10.1016/j.dam.2009.04.023⟩. ⟨hal-00539257⟩



Record views