Algorithmic Aspects of Heterogeneous Biological Networks Comparison

Abstract : Biological networks are commonly used to model molecular activity within the cell. Recent experimental studies have shown that the detection of conserved subnetworks across several networks, coming from di erent organisms, may allow the discovery of disease pathways and prediction of protein functions. There already exist automatic methods that allow to search for conserved subnetworks using networks alignment; unfortunately, these methods are limited to networks of same type, thus having the same graph representation. Towards overcoming this limitation, a uni ed framework for pairwise comparison and analysis of networks with di erent graph representations (in particular, a directed acyclic graph D and an undirected graph G over the same set of vertices) is presented in [4]. We consider here a related problem called k-DAGCC: given a directed graph D and an undirected graph G on the same set V of vertices, and an integer k, does there exist sets of vertices V1; V2; : : : Vk0 , k0 k such that, for each 1 i k0, (i) D[Vi] is a DAG and (ii) G[Vi] is connected ? Two variants of k-DAGCC are of interest: (a) the Vis must form a partition of V , or (b) the Vis must form a cover of V . We study the computational complexity of both variants of k-DAGCC and, depending on the constraints imposed on the input, provide several polynomial-time algorithms, hardness and inapproximability results.
Type de document :
Communication dans un congrès
COCOA 2011, 2011, Zhangjiajie, China. Springer, 6831, pp.272-286, 2011, Lecture Notes in Computer Science. 〈10.1007/978-3-642-22616-8_22〉
Liste complète des métadonnées

Littérature citée [26 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00606375
Contributeur : Guillaume Fertin <>
Soumis le : mercredi 6 juillet 2011 - 11:43:18
Dernière modification le : mercredi 23 mai 2018 - 15:44:02
Document(s) archivé(s) le : lundi 12 novembre 2012 - 10:20:15

Fichier

FamilialCOCOA2011.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, et al.. Algorithmic Aspects of Heterogeneous Biological Networks Comparison. COCOA 2011, 2011, Zhangjiajie, China. Springer, 6831, pp.272-286, 2011, Lecture Notes in Computer Science. 〈10.1007/978-3-642-22616-8_22〉. 〈hal-00606375〉

Partager

Métriques

Consultations de la notice

716

Téléchargements de fichiers

165