Connectivity Inference in Mass Spectrometry based Structure Determination

Deepesh Agarwal 1 Julio Araujo 2 Christelle Caillouet 2 Frédéric Cazals 1 David Coudert 2 Stéphane Perennes 2
1 ABS - Algorithms, Biology, Structure
CRISAM - Inria Sophia Antipolis - Méditerranée
2 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : We consider the following Minimum Connectivity Inference problem (MCI), which arises in structural biology: given vertex sets V i ⊆ V, i ∈ I, find a graph G = (V,E) minimizing the size of the edge set E, such that the sub-graph of G induced by each V i is connected. This problem arises in structural biology, when one aims at finding the pairwise contacts between the proteins of a protein assembly, given the lists of proteins involved in sub-complexes. We present four contributions. First, using a reduction of the set cover problem, we establish that the MCI problem is APX-hard. Second, we show how to solve the problem to optimality using a mixed integer linear programming formulation (MILP). Third, we develop a greedy algorithm based on union-find data structures (Greedy), yielding a 2(log2 |V| + log2 κ)-approximation, with κ the maximum number of subsets V i a vertex belongs to. Fourth, application-wise, we use the MILP and the greedy heuristic to solve the aforementioned connectivity inference problem in structural biology. We show that the solutions of MILP and Greedy are more parsimonious with respect to edges than those reported by the algorithm initially developed in biophysics, which are not qualified in terms of optimality. Since MILP outputs a set of optimal solutions, we introduce the notion of consensus solution. Using assemblies whose pairwise contacts are known exhaustively, we show an almost perfect agreement between the contacts predicted by our algorithms and the experimentally determined ones, especially for consensus solutions.
Type de document :
Communication dans un congrès
Bodlaender, H.L. and Italiano, G.F. European Symposium on Algorithms, Sep 2013, Sophia-Antipolis, France, France. Springer, 8125, pp.289-300, 2013, Lecture Notes in Computer Science - LNCS. 〈http://link.springer.com/chapter/10.1007%2F978-3-642-40450-4_25〉. 〈10.1007/978-3-642-40450-4_25〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00849873
Contributeur : Frederic Cazals <>
Soumis le : jeudi 1 août 2013 - 13:57:19
Dernière modification le : mercredi 8 avril 2015 - 16:36:02

Identifiants

Collections

Citation

Deepesh Agarwal, Julio Araujo, Christelle Caillouet, Frédéric Cazals, David Coudert, et al.. Connectivity Inference in Mass Spectrometry based Structure Determination. Bodlaender, H.L. and Italiano, G.F. European Symposium on Algorithms, Sep 2013, Sophia-Antipolis, France, France. Springer, 8125, pp.289-300, 2013, Lecture Notes in Computer Science - LNCS. 〈http://link.springer.com/chapter/10.1007%2F978-3-642-40450-4_25〉. 〈10.1007/978-3-642-40450-4_25〉. 〈hal-00849873〉

Partager

Métriques

Consultations de la notice

368