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

DOI10.1016/0304-3975(95)00014-NzbMATH Open0873.68042MaRDI QIDQ673107FDOQ673107

Authors: Martin Middendorf 

Publication date: 28 February 1997

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

Recommendations

• scientific article; zbMATH DE number 1555947
• scientific article; zbMATH DE number 1189007
• On minimizing the lengths of checking sequences
• Optimal sets of binary sequences
• scientific article; zbMATH DE number 2010073
• Minimal Polynomial Algorithms for Finite Sequences
• Minimum degree and density of binary sequences
• scientific article; zbMATH DE number 98711
• scientific article; zbMATH DE number 1979670
• On greedy algorithms for binary de Bruijn sequences

zbMATH Keywords

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

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cited In (6)

• On minimizing the lengths of checking sequences
• Approximability of constrained LCS
• Combined super-/substring and super-/subsequence problems
• Title not available (Why is that?)
• Morse‐type information on palais‐smale sequences obtained by min‐max principles
• Minimum degree and density of binary sequences

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

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