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