Complexity issues in color-preserving graph embeddings

Authors:
Gaëlle Brevier;Romeo Rizzi;Stéphane Vialette
Affiliations:
Laboratoire G-SCOPE, 46 avenue Félix Viallet, 38031 Grenoble Cedex, France;Dipartimento di Matematica ed Informatica (DIMI), Università di Udine, Via delle Scienze 208, I-33100 Udine, Italy;IGM-LabInfo, CNRS UMR 8049, Université Paris-Est, 5 Bd Descartes 77454 Marne-la-Vallée, France
Venue:
Theoretical Computer Science
Year:
2010

Citing 12
Cited 0

On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems

SIAM Journal on Discrete Mathematics
Maximum bounded 3-dimensional matching is MAX SNP-complete

Information Processing Letters
Some APX-completeness results for cubic graphs

Theoretical Computer Science
Scheduling split intervals

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Exact algorithms for NP-hard problems: a survey

Combinatorial optimization - Eureka, you shrink!
Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data

RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
On the computational complexity of 2-interval pattern matching problems

Theoretical Computer Science
Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Probability and Computing: Randomized Algorithms and Probabilistic Analysis
NetAlign: a web-based tool for comparison of protein interaction networks

Bioinformatics
Approximating the 2-interval pattern problem

Theoretical Computer Science
Finding exact and maximum occurrences of protein complexes in protein-protein interaction graphs

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

In the context of comparative analysis of protein-protein interaction graphs, we use a graph-based formalism to detect the preservation of a given protein complex (pattern graph) in the protein-protein interaction graph (target graph) of another species with respect to (w.r.t.) orthologous proteins. We give an efficient exponential-time randomized algorithm in case the occurrence of the pattern graph in the target graph is required to be exact. For approximate occurrences, we prove a tight inapproximability result and give four approximation algorithms that deal with bounded degree graphs, small ortholog numbers, linear forests and very simple yet hard instances, respectively.