蛋白质序列的组成表示与欧拉环数
Compositional representation of protein sequences and the number of Eulerian loops
摘要：
蛋白质的氨基酸序列可以被分解成长度为K的连续重叠串。相反的情况有多独特，即，使用在分解中获得的K串的集合重建氨基酸序列？这个问题可以转化为计算欧拉图中欧拉环的个数的问题，但必须对已知的公式进行修改。通过穷举和使用修改的公式，我们表明对于PDB.seq数据库中的绝大多数蛋白质，在K等于或大于5时重建是唯一的。相应的欧拉图为研究蛋白质序列中重复片段的结构提供了一种手段。
英文摘要：
An amino acid sequence of a protein may be decomposed into consecutive overlapping strings of length K. How unique is the converse, i.e., reconstruction of amino acid sequences using the set of K-strings obtained in the decomposition? This problem may be transformed into the problem of counting the number of Eulerian loops in an Euler graph, though the well-known formula must be modified. By exhaustive enumeration and by using the modified formula we show that the reconstruction is unique at K equal or greater than 5 for an overwhelming majority of the proteins in the PDB.seq database. The corresponding Euler graphs provide a means to study the structure of repeated segments in protein sequences.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
