The following publications are possibly variants of this publication:
- Repetition-free longest common subsequenceSaid 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. endm, 30:243-248, 2008. [doi]
- Repetition-free longest common subsequence of random sequencesCristina G. Fernandes, Marcos A. Kiwi. DAM, 210:75-87, 2016. [doi]
- A branch-and-cut approach to the repetition-free longest common subsequence problemCarlos Eduardo Ferreira, Christian Tjandraatmadja. endm, 36:527-534, 2010. [doi]