Polynomial-delay enumeration of maximal common subsequences

DOI10.1007/978-3-030-32686-9_14zbMATH Open1539.68377MaRDI QIDQ6536255

Takeaki Uno, Roberto Grossi, Giulia Punzi, Alessio Conte

Publication date: 19 April 2024

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Cites Work

• Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
• A faster algorithm computing string edit distances
• Maximal common subsequences and minimal common supersequences
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• A fast algorithm for computing longest common subsequences
• Algorithms for the Longest Common Subsequence Problem
• Sparse dynamic programming I
• The String-to-String Correction Problem
• Maximal Common Subsequence Algorithms
• On the Enumeration of Minimal Dominating Sets and Related Notions

This page was built for publication: Polynomial-delay enumeration of maximal common subsequences