A Novel Algorithm for Finding Maximum Common Ordered Subgraph

Nicola Yanev 1, 2 Rumen Andonov 1
1 SYMBIOSE - Biological systems and models, bioinformatics and sequences
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : In this paper, we study the following problem: given are adjacency matrices of two simple graphs. Find two principal matrices (though they are vectors) having the maximum inner product. When used for computing the similarity of two protein structures this problem is called contact map overlap and for the later, we give an exact B&B algorithm with bounds computed by solving Lagrangian relaxation of the problem. The efficiency of the approach is demonstrated on a popular benchmark set of instances together with a comparison with the best existing algorithm.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/inria-00171780
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, September 14, 2007 - 10:37:27 AM
Last modification on : Thursday, April 4, 2019 - 11:48:11 AM
Long-term archiving on : Tuesday, September 21, 2010 - 1:28:33 PM

Files

RR-6287.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00171780, version 2

Citation

Nicola Yanev, Rumen Andonov. A Novel Algorithm for Finding Maximum Common Ordered Subgraph. [Research Report] RR-6287, INRIA. 2007, pp.18. ⟨inria-00171780v2⟩

Share

Metrics

Record views

402

Files downloads

153