A Fast Algorithm for Finding a Maximal Common Subsequence of Multiple Strings. - Miyuji Hirota; Yoshifumi Sakai (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2023)

Efficient algorithms for enumerating maximal common subsequences of two strings. - Miyuji Hirota; Yoshifumi Sakai (Theor. Comput. Sci., 2025)