Efficient algorithms for molecular sequence analysis.

Proc Natl Acad Sci U S A

Department of Mathematics, Stanford University, CA 94305.

Published: February 1988

Efficient (linear time) algorithms are described for identifying global molecular sequence features allowing for errors including repeats, matches between sequences, dyad symmetry pairings, and other sequence patterns. A multiple sequence alignment algorithm is also described. Specific applications are given to hepatitis B viruses and the J5-C (J, joining; C, constant) region of the immunoglobulin kappa gene.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC279651PMC
http://dx.doi.org/10.1073/pnas.85.3.841DOI Listing

Publication Analysis

Top Keywords

molecular sequence
8
efficient algorithms
4
algorithms molecular
4
sequence
4
sequence analysis
4
analysis efficient
4
efficient linear
4
linear time
4
time algorithms
4
algorithms described
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!