The following publications are possibly variants of this publication:
- 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]
- A Fast Multiple Longest Common Subsequence (MLCS) AlgorithmQingguo Wang, Dmitry Korkin, Yi Shang. tkde, 23(3):321-334, 2011. [doi]
- A Real Linear and Parallel Multiple Longest Common Subsequences (MLCS) AlgorithmYanni Li, Hui Li, Tihua Duan, Sheng Wang, Zhi Wang, Yang Cheng. kdd 2016: 1725-1734 [doi]
- A Simple Algorithm for Solving for the Generalized Longest Common Subsequence (LCS) Problem with a Substring Exclusion ConstraintDaxin Zhu, Xiaodong Wang. algorithms, 6(3):485-493, 2013. [doi]
- A New Progressive Algorithm for a Multiple Longest Common Subsequences Problem and Its Efficient ParallelizationJiaoyun Yang, Yun Xu, Guangzhong Sun, Yi Shang. tpds, 24(5):862-870, 2013. [doi]