On finding minimal, maximal, and consistent sequences over a binary alphabet

DOI10.1016/0304-3975(95)00014-NzbMath0873.68042MaRDI QIDQ673107

Martin Middendorf

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

complexitybinary alphabetlongest minimal common supersequenceshortest maximal common non-supersequenceshortest maximal common subsequence

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (2)

Combined super-/substring and super-/subsequence problems ⋮ Approximability of constrained LCS

This page was built for publication: On finding minimal, maximal, and consistent sequences over a binary alphabet