The computation of consensus patterns in DNA sequences

DOI10.1016/0895-7177(93)90117-HMaRDI QIDQ1310190zbMATH OpenOpenAlexFDO

Authors W. H. E. Day, F. R. McMorris

Publication date 4 December 1994

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0895-7177(93)90117-h

zbMATH Keywords

consensus patternsconsensus subsequencesDNA sequencelongest common substring

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Problems related to evolution (92D15)

Cites work

• scientific article; zbMATH DE number 3481857 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 194302 (Why is no real title available?)
• scientific article; zbMATH DE number 4116363 (Why is no real title available?)
• On the number of alignments of k sequences
• Pattern recognition in several sequences: Consensus and alignment
• Sequence Alignments with Matched Sections
• The Complexity of Some Problems on Subsequences and Supersequences
• Trees, Stars, and Multiple Biological Sequence Alignment

Cited in

(2)

• The parameterized complexity of sequence alignment and consensus
• Consensus functions and patterns in molecular sequences

This page was built for publication: The computation of consensus patterns in \(DNA\) sequences

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