A model for topological coding of proteins is proposed. The model is based on the capacity of hydrogen bonds (property of connectivity) to "x conformations of protein molecules. The protein chain is modeled by an n-arc graph with the following elements: vertices ( -carbon atoms), structural edges (p
Topological code of graphs
β Scribed by Cheng-Ho Hsu; Kin-Tak Lam
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 568 KB
- Volume
- 329
- Category
- Article
- ISSN
- 0016-0032
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let be a real number such that 0< < 1 2 and t a positive integer. Let n be a sufficiently large positive integer as a function of t and . We show that every n-vertex graph with at least n 1+ edges contains a subdivision of K t in which each edge of K t is subdivided less than 10 / times. This refine
We prove that every graph of minimum degree at least r and girth at least 186 contains a subdivision of K rΓΎ1 and that for r5435 a girth of at least 15 suffices. This implies that the conjecture of Haj ! o os that every graph of chromatic number at least r contains a subdivision of K r (which is fal
The bounded-degree graph complexes were first introduced by Reiner and Roberts [J. Algebraic Combin. 11 (2000) 135-154]. They arise from the finite free resolution of quadratic Veronese rings and modules. We prove various results about the homotopy types of these complexes, and deduce corresponding