Polynomial-delay enumeration of maximal common subsequences

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

Authors: Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno 

Publication date: 19 April 2024

Recommendations

• Enumeration of maximal common subsequences between two strings
• Maximal common subsequence algorithms
• Maximal common subsequence algorithms
• Maximal common subsequences and minimal common supersequences

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Chaining of maximal exact matches in graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536255)