Repetition-free longest common subsequence
From MaRDI portal
Publication:5900087
DOI10.1016/j.endm.2008.01.042zbMath1341.05002OpenAlexW4243752579MaRDI QIDQ5900087
Marco A. Stefanes, Marie-France Sagot, Cristina G. Fernandes, Christian Tjandraatmadja, Carlos E. Ferreira, Marília D. V. Braga, Said S. Adi, Yoshiko Wakabayashi, Fábio Viduani Martinez
Publication date: 5 June 2008
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2008.01.042
Permutations, words, matrices (05A05) Other combinatorial number theory (11B75) Approximation algorithms (68W25)
Related Items (4)
A branch-and-cut approach to the repetition-free longest common subsequence problem ⋮ Variants of constrained longest common subsequence ⋮ Repetition-free longest common subsequence ⋮ A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant
Cites Work
This page was built for publication: Repetition-free longest common subsequence