Repetition-free longest common subsequence

We study the problem of, given two sequences x and y over a finite alphabet, finding a repetitionfree longest common subsequence of x and y. We show several algorithmic results, a complexity result, and we describe a preliminary experimental study based on the proposed algorithms.

• Type: Journal
• Year: 2008
• Where: ENDM
• Authors: Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco A. Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi
• Keywords: ENDM 2008, Finite Alphabet, Longest Common Subsequence, Sequences