Reachability, Connectivity, and Proximity in Chemical Spaces

被引:0
|
作者
Stadler, Barbel M. R. [1 ]
Stadler, Peter F. [1 ,2 ,3 ,4 ,5 ,6 ,7 ,8 ,9 ,10 ]
机构
[1] Max Planck Inst Math Sci, D-04109 Leipzig, Germany
[2] Univ Leipzig, Bioinformat Grp, Dept Comp Sci, D-04107 Leipzig, Germany
[3] Univ Leipzig, Interdisciplinary Ctr Bioinformat, D-04107 Leipzig, Germany
[4] Univ Leipzig, German Ctr Integrat Biodivers Res iDiv Halle Jena, D-04107 Leipzig, Germany
[5] Univ Leipzig, Competence Ctr Scalable Data Serv & Solut Dresden, D-04107 Leipzig, Germany
[6] Univ Leipzig, Leipzig Res Ctr Civilizat Dis, D-04107 Leipzig, Germany
[7] Fraunhofer Inst Cell Therapy & Immunol, D-04103 Leipzig, Germany
[8] Univ Vienna, Dept Theoret Chem, A-1090 Vienna, Austria
[9] Univ Copenhagen, Ctr RNA Technol & Hlth, Frederiksberg C, Denmark
[10] Santa Fe Inst, Santa Fe, NM 87501 USA
关键词
UNIVERSE;
D O I
暂无
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
A chemical universe consists of a set X of chemical compounds and a set of reactions between them. Each reaction transforms a finite (small) multiset of educts in a small multiset of products. In the topological context explored here, stoichiometry is neglected, and products and educts are treated as simple sets. Reactions thus form directed hyperedges on X. Since X can be infinite, it is of interest to consider X not only for a combinatorial point of view but also as a topological construct. Here we argue that generalized reaches and relative closure functions provide a natural framework. These can be seen as generalizations of connected components and are equivalent to a certain class of separation or proximity spaces. We consider notions of strong and weak connected components and derive their basic properties, and we characterize the conditions under which they are equivalent to generalized closure spaces; as it turns out, chemical universes are very different from this more well-behaved type of generalized topologies. The theory presented here provides a solid ground to further investigate concepts related to connectivity in a very general class of models that in particular includes chemistry.
引用
收藏
页码:639 / 659
页数:21
相关论文
共 50 条
  • [1] CONNECTIVITY VS REACHABILITY
    CHROBAK, M
    KARLOFF, H
    RADZIK, T
    INFORMATION AND COMPUTATION, 1991, 91 (02) : 177 - 188
  • [2] Connectivity and reachability in signed networks
    Tataram, Monica
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2007, 13 (11) : 1779 - 1790
  • [3] Reachability and connectivity queries in constraint databases
    Benedikt, M
    Grohe, M
    Libkin, L
    Segoufin, L
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 66 (01) : 169 - 206
  • [4] Mutual proximity graphs for improved reachability in music recommendation
    Flexer, Arthur
    Stevens, Jeff
    JOURNAL OF NEW MUSIC RESEARCH, 2018, 47 (01) : 17 - 28
  • [5] Distributed Tree Rearrangements for Reachability and Robust Connectivity
    Schuresko, Michael
    Cortes, Jorge
    HYBRID SYSTEMS: COMPUTATION AND CONTROL, 2009, 5469 : 470 - +
  • [6] DISTRIBUTED TREE REARRANGEMENTS FOR REACHABILITY AND ROBUST CONNECTIVITY
    Schuresko, Michael
    Cortes, Jorge
    SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2012, 50 (05) : 2588 - 2620
  • [7] Establishing Connectivity in Proximity Networks
    Dai, Ran
    Maximoff, Joshua
    Mesbahi, Mehran
    2012 AMERICAN CONTROL CONFERENCE (ACC), 2012, : 4180 - 4185
  • [8] PROXIMITY ORDERED SPACES
    SINGAL, MK
    LAL, S
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1976, 14 (DEC): : 393 - 404
  • [9] Coproducts of proximity spaces
    Pawel Grzegrzolka
    Afrika Matematika, 2020, 31 : 751 - 770
  • [10] Coproducts of proximity spaces
    Grzegrzolka, Pawel
    AFRIKA MATEMATIKA, 2020, 31 (5-6) : 751 - 770