Progressive Multiple Alignment of Graphs

Progressive Multiple Alignment of Graphs

The comparison of multiple (labeled) graphs with unrelated vertex sets is an important task in diverse areas of applications. Conceptually, it is often closely related to multiple sequence alignments since one aims to determine a correspondence, or more precisely, a multipartite matching between the...

Full description

Bibliographic Details
Main Authors: Marcos E. González Laffitte, Peter F. Stadler
Format: Article
Language:English
Published: MDPI AG 2024-03-01
Series:Algorithms
Subjects:
multiple alignment
common induced subgraphs
combinatorial optimization
labeled graphs
applications of graph kernels
VF2 algorithm
Online Access:https://www.mdpi.com/1999-4893/17/3/116

Internet

https://www.mdpi.com/1999-4893/17/3/116

Similar Items