Karlin, Samuel; Morris, Macdonald; Ghandour, Ghassan; Leung, Ming-Ying Efficient algorithms for molecular sequence analysis. (English) Zbl 0633.92005 Proc. Natl. Acad. Sci. USA 85, No. 4, 841-845 (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 \(J_ 5-C\) (J, joining; C, constant) region of the immunoglobulin \(\kappa\) gene. Cited in 1 Document MSC: 92Cxx Physiological, cellular and medical topics 92-08 Computational methods for problems pertaining to biology 68U99 Computing methodologies and applications Keywords:biochemistry; Efficient (linear time) algorithms; identifying global molecular sequence features; dyad symmetry pairings; multiple sequence alignment algorithm; hepatitis B viruses; \(J_ 5-C\); immunoglobulin PDFBibTeX XMLCite \textit{S. Karlin} et al., Proc. Natl. Acad. Sci. USA 85, No. 4, 841--845 (1988; Zbl 0633.92005) Full Text: DOI