Two local dissimilarity measures for weighted graphs with application to protein interaction networks
type: Item
instance of: scholarly article
title: Two local dissimilarity measures for weighted graphs with application to protein interaction networks
zbMATH Open document ID: 1146.05019
author: Jean-Baptiste Angelelli
author: Anaïs Baudot
author: Christine Brun
author: Alain Guénoche
published in: Advances in Data Analysis and Classification. ADAC
publication date: 2008-10-21T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5354739
zbMATH Keywords: graph distance
zbMATH Keywords: graph partitioning
zbMATH Keywords: heuristic optimisation
zbMATH Keywords: biological networks
describes a project that uses: MCODE
describes a project that uses: BIONJ
Wikidata QID: Q61198250
MaRDI profile type: Publication
full work available at URL: s11634-008-0018-3
OpenAlex ID: W2054360688
cites work: Maximum transfer distance between partitions
cites work: The complexity of computing metric distances between partitions
cites work: Q3702302
cites work: Community structure in social and biological networks
cites work: Comparing recent methods in graph partitioning
cites work: Comparison of algorithms in graph partitioning
cites work: Computing Communities in Large Networks Using Random Walks
DBLP publication ID: journals/adac/AngelelliBBG08
DOI: 10.1007/S11634-008-0018-3
Recommended article: A new dissimilarity measure for comparing labeled graphs
Recommended article: Network comparison and the within-ensemble graph distance
Recommended article: Q5283715
Recommended article: Network Distances for Weighted Digraphs
Recommended article: On a local similarity of graphs
Recommended article: Toward Quantifying Vertex Similarity in Networks
Recommended article: Q4496079
Recommended article: Q5445046
description: scientific article; zbMATH DE number 5354739