✦ LIBER ✦

Graph similarity scoring and matching

✍ Scribed by Laura A. Zager; George C. Verghese

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 601 KB
Volume: 21
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2007.01.006

No coin nor oath required. For personal study only.

✦ Synopsis

We outline a class of graph similarity measures that uses the structural similarity of local neighborhoods to derive pairwise similarity scores for the nodes of two different graphs, and present a related similarity measure that uses a linear update to generate both node and edge similarity scores. This measure is then applied to the task of graph matching.

📜 SIMILAR VOLUMES

Multivariate image similarity in the com

Multivariate image similarity in the compressed domain using statistical graph matching

✍ Ch. Theoharatos; V.K. Pothos; N.A. Laskaris; G. Economou; S. Fotopoulos 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 831 KB

Matchings and matching extensions in gra

Matchings and matching extensions in graphs

✍ Ciping Chen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Let G be a graph with a perfect matching and k be an integer such that l~<k< I V(G)l/2. Then G is said to be k-extendable if every matching of size k in G extends to a perfect matching of G. Plummer (1994) proved that every (2k + 1)-connected K~,s-free graph of even order is k-extendable. In this p

Linear notations and molecular graph sim

Linear notations and molecular graph similarity

✍ William C. Herndon; Steven H. Bertz 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 713 KB

l b o simple linear notation systems are suggested to encode molecular structure including stereochemical elements. Both systems give rise to a unique numbering of the molecular graph, and thus also lead to a unique linear notation. Both linear notation systems are extremely compact and require only

Collapsible graphs and matchings

✍ Zhi-Hong Chen; Hong-Jian Lai 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB

## Abstract A graph __G__ is __collapsible__ if for every even subset __R__ ⊆ __V__(__G__), there is a spanning connected subgraph of __G__ whose set of odd degree vertices is __R__. A graph is __reduced__ if it does not have nontrivial collapsible subgraphs. Collapsible and reduced graphs are defi

Directed Graph Pattern Matching and Topo

Directed Graph Pattern Matching and Topological Embedding

✍ James Jianghai Fu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 196 KB

Pattern matching in directed graphs is a natural extension of pattern matching in trees and has many applications to different areas. In this paper, we study several pattern matching problems in ordered labeled directed graphs. For the rooted directed graph pattern matching problem, we present an ef

Scoring ligand similarity in structure-b

Scoring ligand similarity in structure-based virtual screening

✍ Maria I. Zavodszky; Anjali Rohatgi; Jeffrey R. Van Voorst; Honggao Yan; Leslie A 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 534 KB

## Abstract Scoring to identify high‐affinity compounds remains a challenge in virtual screening. On one hand, protein–ligand scoring focuses on weighting favorable and unfavorable interactions between the two molecules. Ligand‐based scoring, on the other hand, focuses on how well the shape and che