Maximal common subsequences and minimal common supersequences

DOI10.1006/inco.1996.0011zbMath0853.68090OpenAlexW2074728539MaRDI QIDQ1917072

Robert W. Irving, Campbell B. Fraser

Publication date: 2 January 1997

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3faabc83780a93018cf25b0be628424784df58c5

zbMATH Keywords

longest minimal common supersequence problemshortest maximal common subsequence problem

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (7)

Combined super-/substring and super-/subsequence problems ⋮ Longest common subsequences ⋮ Consistent subsequences and supersequences ⋮ Analogical Proportions in a Lattice of Sets of Alignments Built on the Common Subwords in a Finite Language ⋮ Maximal common subsequence algorithms ⋮ Maximal Common Subsequence Algorithms ⋮ Enumeration of maximal common subsequences between two strings

This page was built for publication: Maximal common subsequences and minimal common supersequences