PMID:3124111
| Citation |
Karlin, S, Morris, M, Ghandour, G and Leung, MY (1988) Efficient algorithms for molecular sequence analysis. Proc. Natl. Acad. Sci. U.S.A. 85:841-5 |
|---|---|
| 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. |
| Links | |
| Keywords |
Algorithms; Amino Acid Sequence; Animals; Base Sequence; Genes, Immunoglobulin; Genes, Viral; Hepatitis Viruses/genetics; Humans; Immunoglobulin kappa-Chains/genetics; Mice; Rabbits; Sequence Homology, Nucleic Acid |
| edit table |
Significance
You can help EcoliWiki by summarizing why this paper is useful
Useful Materials and Methods
You can help Ecoliwiki by describing the useful materials (strains, plasmids, antibodies, etc) described in this paper.
Annotations
<annotationlinks/>
EcoliWiki Links
Add links to pages that link here (e.g. gene, product, method pages)
References
See Help:References for how to manage references in EcoliWiki.