The following publications are possibly variants of this publication:
- Efficient Dominant Point Algorithms for the Multiple Longest Common Subsequence (MLCS) ProblemQingguo Wang, Dmitry Korkin, Yi Shang. IJCAI 2009: 1494-1500 [doi]
- An Efficient Parallel Algorithm for the Multiple Longest Common Subsequence (MLCS) ProblemDmitry Korkin, Qingguo Wang, Yi Shang. icpp 2008: 354-363 [doi]
- A path recorder algorithm for Multiple Longest Common Subsequences (MLCS) problemsShiwei Wei, Yuping Wang, Yuanchao Yang, Sen Liu. bioinformatics, 36(10):3035-3042, 2020. [doi]
- Linear-space S-table algorithms for the longest common subsequence problemBi-Shiang Lin, Kuo-Si Huang, Chang-Biau Yang. TCS, 964:113944, 2023. [doi]