符号序列的相似性

摘要：

提出了一种新的符号序列的数值刻画。基于Ke和Tong算法的序列划分是本文的出发点。算法将原始序列分解为一组不同的连续性模式。两个符号序列（它们的交集）共同的连续性集合被提出作为它们之间相似性的度量。新的相似性度量适用于短（几十个字母）序列和非常长（数十万个字母）的序列。当应用于核苷酸或蛋白质序列时，可能有助于追踪物种可能的进化。作为说明，检查了几组核苷酸和氨基酸序列的相似性。

英文摘要：

A new numerical characterization of symbolic sequences is proposed. The partition of sequence based on Ke and Tong algorithm is a starting point. Algorithm decomposes original sequence into set of distinct subsequences - a patterns. The set of subsequences common for two symbolic sequences (their intersection) is proposed as a measure of similarity between them. The new similarity measure works well for short (of tens letters) sequences and the very long (of hundred thousand letters) as well. When applied to nucleotide or protein sequences may help to trace possible evolutionary of species. As an illustration, similarity of several sets of nucleotide and amino acid sequences is examined.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。