CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2013 vol.10 Issue No.02 - March-April

Subscribe

Issue No.02 - March-April (2013 vol.10)

pp: 504-513

Ali Gholami Rudi , Fac. of Electr. & Comput. Eng., Tarbiat Modares Univ., Tehran, Iran

Saeed Shahrivari , Fac. of Electr. & Comput. Eng., Tarbiat Modares Univ., Tehran, Iran

Saeed Jalili , Fac. of Electr. & Comput. Eng., Tarbiat Modares Univ., Tehran, Iran

Zahra Razaghi Moghadam Kashani , Fac. of Electr. & Comput. Eng., Tarbiat Modares Univ., Tehran, Iran

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2012.167

ABSTRACT

Given a multiset of colors as the query and a list-colored graph, i.e., an undirected graph with a set of colors assigned to each of its vertices, in the NP-hard list-colored graph motif problem the goal is to find the largest connected subgraph such that one can select a color from the set of colors assigned to each of its vertices to obtain a subset of the query. This problem was introduced to find functional motifs in biological networks. We present a branch-and-bound algorithm named RANGI for finding and enumerating list-colored graph motifs. As our experimental results show, RANGI's pruning methods and heuristics make it quite fast in practice compared to the algorithms presented in the literature. We also present a parallel version of RANGI that achieves acceptable scalability.

INDEX TERMS

Color, Heuristic algorithms, Computational biology, Bioinformatics, Proteins,list-colored graphs, Color, Heuristic algorithms, Computational biology, Bioinformatics, Proteins, protein-interaction networks, Branch-and-bound algorithms, parallel algorithms

CITATION

Ali Gholami Rudi, Saeed Shahrivari, Saeed Jalili, Zahra Razaghi Moghadam Kashani, "RANGI: A Fast List-Colored Graph Motif Finding Algorithm",

*IEEE/ACM Transactions on Computational Biology and Bioinformatics*, vol.10, no. 2, pp. 504-513, March-April 2013, doi:10.1109/TCBB.2012.167REFERENCES

- [1] R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon, "Network Motifs: Simple Building Blocks of Complex Networks,"
Science, vol. 298, no. 5594, pp. 824-827, 2002.- [2] V. Lacroix, C. Fernandes, and M. Sagot, "Motif Search in Graphs: Application to Metabolic Networks,"
IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 3, no. 4, pp. 360-368, Oct.-Dec. 2006.- [3] S. Wernicke and F. Rasche, "Fanmod: A Tool for Fast Network Motif Detection,"
Bioinformatics, vol. 22, no. 9, pp. 1152-1153, 2006.- [4] Z.R.M. Kashani, H. Ahrabian, E. Elahi, A. Nowzari-Dalini, E. Ansari, S. Asadi, S. Mohammadi, F. Schreiber, and A. Masoudi-Nejad, "Kavosh: A New Algorithm for Finding Network Motifs,"
BMC Bioinformatics, vol. 10, article 318, 2009.- [5] S. Bruckner, F. Hüffner, R. Karp, R. Shamir, and R. Sharan, "Topology-Free Querying of Protein Interaction Networks,"
Proc. 13th Ann. Int'l Conf. Research in Computational Molecular Biology, pp. 74-89, 2009.- [6] G. Blin, F. Sikora, and S. Vialette, "Gramofone: A Cytoscape Plugin for Querying Motifs without Topology in Protein-Protein Interactions Networks,"
Proc. Int'l Conf. Bioinformatics and Computational Biology, pp. 38-43, 2010.- [7] N. Betzler, R.V. Bevern, M. Fellows, C. Komusiewicz, and R. Niedermeier, "Parameterized Algorithmics for Finding Connected Motifs in Biological Networks,"
IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 8, no. 5, pp. 1296-1308, Sept./Oct. 2011.- [8] S. Guillemot and F. Sikora, "Finding and Counting Vertex-Colored Subtrees,"
Algorithmica, pp. 1-17, DOI: 10.1007/s00453-011-9600-8, 2012.- [9] M. Fellows, G. Fertin, D. Hermelin, and S. Vialette, "Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs,"
J. Computer and System Sciences, vol. 77, no. 4, pp. 799-811, 2011.- [10] S. Guillemot and F. Sikora, "Finding and Counting Vertex-Colored Subtrees,"
Proc. Int'l Conf. Math. Foundations of Computer Science, pp. 405-416, 2010.- [11] I. Koutis, "Constrained Multilinear Detection for Faster Functional Motif Discovery,"
Information Processing Letters, vol. 112, no. 22, pp. 889-892, 2012.- [12] A. Björklund, P. Kaski, and L. Kowalik, "Probably Optimal Graph Motifs,"
ArXiv e-prints, http://adsabs.harvard.edu/abs2012arXiv1209.1082B , 2012.- [13] R. Dondi, G. Fertin, and S. Vialette, "Finding Approximate and Constrained Motifs in Graphs,"
Proc. Ann. Conf. Combinatorial Pattern Matching, pp. 388-401, 2011.- [14] A. Ambalath, R. Balasundaram, C. Rao H, V. Koppula, N. Misra, G. Philip, and M. Ramanujan, "On the Kernelization Complexity of Colorful Motifs,"
Proc. Int'l Symp. Parameterized and Exact Computation, pp. 14-25, 2010.- [15] N. Alon, R. Yuster, and U. Zwick, "Color-Coding,"
J. ACM, vol. 42, no. 4, pp. 844-856, 1995.- [16] J. Hopcroft and R. Karp, "A $n^{5/2}$ Algorithm for Maximum Matchings in Bipartite Graphs,"
SIAM J. Computing, vol. 2, no. 4, pp. 225-231, 1973.- [17] C. Komusiewicz and M. Sorge, "Finding Dense Subgraphs of Sparse Graphs,"
Proc. Int'l Symp. Parameterized and Exact Computation, pp. 242-251, 2012.- [18]
SGD Project, Saccharomyces Genome Database, http:/ downloads.yeastgenome.org/, 2012.- [19] D. Barrell, E. Dimmer, R. Huntley, D. Binns, C. O'Donovan, and R. Apweiler, "The Goa Database in 2009 an Integrated Gene Ontology Annotation Resource,"
Nucleic Acids Research, vol. 37, no. Suppl. 1, pp. D396-D403, 2009.- [20] S. Tweedie, M. Ashburner, K. Falls, P. Leyland, P. McQuilton, S. Marygold, G. Millburn, D. Osumi-Sutherland, A. Schroeder, R. Seal, and H. Zhang, "Flybase: Enhancing Drosophila Gene Ontology Annotations,"
Nucleic Acids Research, vol. 37, no. Suppl. 1, pp. D555-D559, 2009.- [21] E. Boyle, S. Weng, J. Gollub, H. Jin, D. Botstein, J. Cherry, and G. Sherlock, "Go::Termfinder-Open Source Software for Accessing Gene Ontology Information and Finding Significantly Enriched Gene Ontology Terms Associated with a List of Genes,"
Bioinformatics, vol. 20, no. 18, pp. 3710-3715, 2004. |