most citedEfficient algorithms for enumerating maximal common subsequences of two strings

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2023★ 2 cited

Efficient algorithms for enumerating maximal common subsequences of two strings

Miyuji Hirota, Yoshifumi Sakai

We propose efficient algorithms for enumerating maximal common subsequences (MCSs) of two strings. Efficiency of the algorithms are estimated by the preprocessing-time, space, and…