Compositional representation of protein sequences and the number of Eulerian loops
| dc.creator | Hao, Bailin | |
| dc.creator | Xie, Huimin | |
| dc.creator | Zhang, Shuyu | |
| dc.date | 2001-03-10 | |
| dc.date.accessioned | 2026-07-07T05:45:34Z | |
| dc.date.available | 2026-07-07T05:45:34Z | |
| dc.description | 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. | |
| dc.description | 5 pages, no figure, 2 tables, RevTex3.1 | |
| dc.identifier | https://arxiv.org/abs/physics/0103028 | |
| dc.identifier | http://arxiv.org/abs/physics/0103028 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/84035 | |
| dc.subject | Biological Physics | |
| dc.subject | Quantitative Biology | |
| dc.title | Compositional representation of protein sequences and the number of Eulerian loops | |
| dc.type | text |