The computation of consensus patterns in DNA sequences

Authors:
William H. E. Day;F. R. Mcmorris
Affiliations:
Department of Computer Science, Memorial University of Newfoundland St. John's, Newfoundland A1C 5S7, Canada;Department of Mathematics, University of Louisville Louisville, KY 40292, USA
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1993

Citing 4
Cited 0

Sequence alignments with matched sections

SIAM Journal on Algebraic and Discrete Methods
Trees, stars, and multiple biological sequence alignment

SIAM Journal on Applied Mathematics
The Complexity of Some Problems on Subsequences and Supersequences

Journal of the ACM (JACM)
Mathematical Methods for DNA Sequences

Mathematical Methods for DNA Sequences

Quantified Score

Hi-index	0.98

Visualization

Abstract

Two important consensus problems are closely related to two well-known sequence problems. M. Waterman's problem of finding consensus strings is a natural extension of the Longest Common Substring problem. The problem of identifying consensus subsequences is a natural extension of the Longest Common Subsequence problem, and thus is NP-hard.