Efficient algorithms for molecular sequence analysis.
- 1 February 1988
- journal article
- research article
- Published by Proceedings of the National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 85 (3) , 841-845
- https://doi.org/10.1073/pnas.85.3.841
Abstract
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.This publication has 7 references indexed in Scilit:
- DNA sequence comparisons of the human, mouse, and rabbit immunoglobulin kappa gene.Molecular Biology and Evolution, 1985
- Comparative analysis of human and bovine papillomaviruses.Molecular Biology and Evolution, 1984
- Immunoglobulin gene transcription is activated by downstream sequence elementsCell, 1983
- Rapid similarity searches of nucleic acid and protein data banks.Proceedings of the National Academy of Sciences, 1983
- A simple method for displaying the hydropathic character of a proteinJournal of Molecular Biology, 1982
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970