activity
20232026
most citedThe Complexity of Maximal Common Subsequence Enumeration

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

collaborators
Showing 2023Show all

1 paper · 1 filter

cs.DS2023

A Compact DAG for Storing and Searching Maximal Common Subsequences

Alessio Conte, Roberto Grossi, Giulia Punzi +1

Maximal Common Subsequences (MCSs) between two strings X and Y are subsequences of both X and Y that are maximal under inclusion. MCSs relax and generalize the well known and widel…