Results 261 to 270 of about 446,524 (307)
Graph Kernels for Molecular and Reduced Graphs
, 2007 Demco, Anthony, Saunders, Craig
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Current Computer Aided-Drug Design, 2011
Since the last half of the nineteenth century, molecular graphs have been present in several branches of chemistry. When used for molecular structure representation, they have been compared after mapping the corresponding graphs into mathematical objects. However, direct molecular comparison of molecular graphs is a research field less explored.
Jenny A, Melo, Edgar, Daza
openaire +2 more sources
Since the last half of the nineteenth century, molecular graphs have been present in several branches of chemistry. When used for molecular structure representation, they have been compared after mapping the corresponding graphs into mathematical objects. However, direct molecular comparison of molecular graphs is a research field less explored.
Jenny A, Melo, Edgar, Daza
openaire +2 more sources
Chirality of Toroidal Molecular Graphs
Journal of Chemical Information and Modeling, 2005Symmetry properties of a class of toroidal molecular graphs, arising as covers of certain bipartite cubic Cayley graphs of dihedral groups, are studied. Although these symmetries make all vertices and all edges indistinguishable, they imply intrinsic chirality.
Klavdija, Kutnar +2 more
openaire +2 more sources
Journal of Chemical Information and Computer Sciences, 2001
Walks in molecular graphs and their counts for a long time have found applications in theoretical chemistry. These are based on the fact that the (i, j)-entry of the kth power of the adjacency matrix is equal to the number of walks starting at vertex i, ending at vertex j, and having length k. In recent papers (refs 13, 18, 19) the numbers of all walks
Gutman, Ivan +2 more
openaire +3 more sources
Walks in molecular graphs and their counts for a long time have found applications in theoretical chemistry. These are based on the fact that the (i, j)-entry of the kth power of the adjacency matrix is equal to the number of walks starting at vertex i, ending at vertex j, and having length k. In recent papers (refs 13, 18, 19) the numbers of all walks
Gutman, Ivan +2 more
openaire +3 more sources
Graph Kernels for Molecular Similarity
Molecular Informatics, 2010AbstractMolecular similarity measures are important for many cheminformatics applications like ligand‐based virtual screening and quantitative structure‐property relationships. Graph kernels are formal similarity measures defined directly on graphs, such as the (annotated) molecular structure graph. Graph kernels are positive semi‐definite functions, i.
Matthias, Rupp, Gisbert, Schneider
openaire +2 more sources