18 citations · 24 across the 10 of their papers we have counts for
Showing 2023Show all
2 papers · 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…
cs.DS2023
Computing matching statistics on Wheeler DFAs
Alessio Conte, Nicola Cotumaccio, Travis Gagie +3
Matching statistics were introduced to solve the approximate string matching problem, which is a recurrent subroutine in bioinformatics applications. In 2010, Ohlebusch et al. [SPI…