Efficient algorithms for molecular sequence analysis.
Samuel Karlin, Macdonald S. Morris, Ghassan Ghandour et al. · Proceedings of the National Academy of Sciences · 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.
Cited by 49 works. doi:10.1073/pnas.85.3.841
Authors
References
- A general method applicable to the search for similarities in the amino acid sequence of two proteins
- A simple method for displaying the hydropathic character of a protein
- Rapid similarity searches of nucleic acid and protein data banks.
- Immunoglobulin gene transcription is activated by downstream sequence elements
- Nucleotide sequence of an infectious molecularly cloned genome of ground squirrel hepatitis virus
- Comparative analysis of human and bovine papillomaviruses.
- DNA sequence comparisons of the human, mouse, and rabbit immunoglobulin kappa gene.
- The use of multiple alphabets in kappa‐gene immunoglobulin DNA sequence comparisons.