Efficient Algorithms for Finding Diverse Longest Common Subsequences in Graphs

This paper studies the problem of efficiently finding a diverse set of longest common subsequences (LCSs) from a set of input strings, considering both sum and minimum diversity measures under Hamming distance. The authors analyze the computational complexity of these problems, providing polynomial-time algorithms for bounded K, as well as PTAS and FPT algorithms for unbounded K.