We consider the problem of identifying the dimension in which a sample of data points lives, when only their interpoint distances are known. We study as a random variable the average ''reach'' of vertices in the k-nearest-neighbors graph associated to the interpoint distance matrix, and we show how
Graph-theoretical identification of pathways for biochemical reactions
✍ Scribed by H. Seo; D.-Y. Lee; S. Park; L.T. Fan; S. Shafie; B. Bertók; F. Friedler
- Book ID
- 110305198
- Publisher
- Springer Netherlands
- Year
- 2001
- Tongue
- English
- Weight
- 143 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0141-5492
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract Cells grow by oxidizing nutrients using a complex network of biochemical reactions. During this process new biological material is produced along with energy used for maintaining cellular organization. Because the metabolic network is highly branched, these tasks can be accomplished usi
## Abstract Biomolecular association and dissociation reactions take place on complicated interaction free energy landscapes that are still very hard to characterize computationally. For large enough distances, though, it often suffices to consider the six relative translational and rotational degr