Efficient algorithms for molecular sequence analysis.

DOI10.1073/PNAS.85.3.841zbMATH Open0633.92005OpenAlexW2054796096WikidataQ37486044 ScholiaQ37486044MaRDI QIDQ3772020FDOQ3772020

Authors: Samuel Karlin, MacDonald Morris, Ming-Ying Leung, Ghassan I. Ghandour 

Publication date: 1988

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.85.3.841

Recommendations

• Pattern recognition in several sequences: Consensus and alignment
• scientific article; zbMATH DE number 826057
• Publication:4206397
• scientific article; zbMATH DE number 434724
• Efficient methods for multiple sequence alignment with guaranteed error bounds

zbMATH Keywords

immunoglobulinbiochemistry\(J_ 5-C\)dyad symmetry pairingsEfficient (linear time) algorithmshepatitis B virusesidentifying global molecular sequence featuresmultiple sequence alignment algorithm

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Computational methods for problems pertaining to biology (92-08) Physiological, cellular and medical topics (92Cxx)

Cited In (8)

• Pattern recognition in several sequences: Consensus and alignment
• Macromolecular sequence analysis using multiwindow Gabor representations
• Algorithms For Computing Approximate Repetitions In Musical Sequences
• Efficient algorithms for local alignment search
• Title not available (Why is that?)
• Title not available (Why is that?)
• Pattern recognition in genetic sequences by mismatch density
• Title not available (Why is that?)

This page was built for publication: Efficient algorithms for molecular sequence analysis.

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