Karlin S, Morris M, Ghandour G, Leung M Y
Department of Mathematics, Stanford University, CA 94305.
Proc Natl Acad Sci U S A. 1988 Feb;85(3):841-5. doi: 10.1073/pnas.85.3.841.
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.
本文描述了高效(线性时间)算法,用于识别全局分子序列特征,这些特征允许存在包括重复、序列间匹配、二元对称配对和其他序列模式在内的错误。还描述了一种多序列比对算法。并给出了在乙型肝炎病毒和免疫球蛋白κ基因的J5-C(J,连接;C,恒定)区域的具体应用。