Repetition-free longest common subsequence - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2010

Repetition-free longest common subsequence

S.S Adi
  • Function : Author
M. Braga
  • Function : Author
C.G. Fernandes
  • Function : Author
C.E. Ferreira
  • Function : Author
F.V. Martinez
  • Function : Author
M.-F. Sagot
M.A. Stefanes
  • Function : Author
C. Tjandraatmadja
  • Function : Author
Y. Wakabayashi
  • Function : Author


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.

Dates and versions

hal-00539257 , version 1 (24-11-2010)



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



Gmail Facebook X LinkedIn More