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]
- 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]
- Dynamic-MLCS: Fast searching for dynamic multiple longest common subsequences in sequence stream dataYuanyuan Fu, Chunyang Wang, Jixin Zhu, Qun Zhang, Yiu-ming Cheung, Yuping Wang 0003. kbs, 293:111654, 2024. [doi]
- A Fast Heuristic Search Algorithm for Finding the Longest Common Subsequence of Multiple StringsQingguo Wang, Mian Pan, Yi Shang, Dmitry Korkin. AAAI 2010: 1287-1292 [doi]