Two local dissimilarity measures for weighted graphs with application to protein interaction networks

DOI10.1007/S11634-008-0018-3MaRDI QIDQ949442zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jean-Baptiste Angelelli, Anaïs Baudot, Christine Brun, Alain Guénoche

Publication date 21 October 2008

Published in Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11634-008-0018-3

zbMATH Keywords

biological networksgraph distancegraph partitioningheuristic optimisation

Mathematics Subject Classification ID

Distance in graphs (05C12) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A new dissimilarity measure for comparing labeled graphs
• Network comparison and the within-ensemble graph distance
• Some properties of a dissimilarity measure for labeled graphs
• Network distances for weighted digraphs
• On a local similarity of graphs
• Toward quantifying vertex similarity in networks
• scientific article; zbMATH DE number 1489856
• A new method of measuring similarity for a special class of directed graphs

Cites work

• Community structure in social and biological networks
• Comparing recent methods in graph partitioning
• Comparison of algorithms in graph partitioning
• Computing Communities in Large Networks Using Random Walks
• scientific article; zbMATH DE number 3928114 (Why is no real title available?)
• Maximum transfer distance between partitions
• The complexity of computing metric distances between partitions

Cited in

(8)

• A new quantitative structure-property relationship approach using dissimilarity measurements based on topological distances of non-isomorphic subgraphs
• Topology association analysis in weighted protein interaction network for gene prioritization
• A simple extension of the bag-of-paths model weighting path lengths by a Poisson distribution
• Distances in graph partitioning
• Edge-weighting of gene expression graphs
• Network distances for weighted digraphs
• Some properties of a dissimilarity measure for labeled graphs
• Bootstrap clustering for graph partitioning

Describes a project that uses

Uses Software

• BIONJ
• MCODE

This page was built for publication: Two local dissimilarity measures for weighted graphs with application to protein interaction networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q949442)