Enumeration of maximal common subsequences between two strings
type: Item
instance of: scholarly article
title: Enumeration of maximal common subsequences between two strings
author: Alessio Conte
author: Roberto Grossi
author: Giulia Punzi
author: Takeaki Uno
published in: Algorithmica
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7495495
zbMATH Keywords: maximal common subsequence
zbMATH Keywords: subsequence
zbMATH Keywords: LCS
zbMATH Keywords: enumeration
zbMATH Keywords: polynomial-delay
describes a project that uses: MUMMER
MaRDI profile type: Publication
full work available at URL: s00453-021-00898-5
OpenAlex ID: W4206410708
cites work: Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
cites work: Directed acyclic subsequence graph -- overview
cites work: Maximal common subsequences and minimal common supersequences
cites work: Algorithms for the Longest Common Subsequence Problem
cites work: Computing a longest common subsequence for a set of strings
cites work: A fast algorithm for computing longest common subsequences
cites work: On the complexity of \(k\)-SAT
cites work: On the Enumeration of Minimal Dominating Sets and Related Notions
cites work: Q4369384
cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
cites work: A faster algorithm computing string edit distances
cites work: Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
cites work: Maximal Common Subsequence Algorithms
cites work: Maximal common subsequence algorithms
cites work: The String-to-String Correction Problem
DOI: 10.1007/S00453-021-00898-5
description: scientific article; zbMATH DE number 7495495