Generalized sequence alignment and duality

DOI10.1006/aama.1993.1008zbMath0810.92012OpenAlexW2036479856MaRDI QIDQ1261853

Pavel A. Pevzner, Michael S. Waterman

Publication date: 5 September 1993

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/aama.1993.1008

zbMATH Keywords

posetslongest common subsequenceminimum coverDilworth's theoremcompatibility graphduality resultsequence alignmentsA-LCS-problemsgeneralized alignmentslongest chainminimum Hilbert bases problemprimal-dual-algorithm

Mathematics Subject Classification ID

Partial orders, general (06A06) Paths and cycles (05C38) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20)

Related Items (2)

An almost-linear time and linear space algorithm for the longest common subsequence problem ⋮ A polyhedral approach to sequence alignment problems

This page was built for publication: Generalized sequence alignment and duality