A System For Motif Search In Biological Networks
Authors: 
Alexandre da Silva Freire, Karla R. P. S. Lima, Diego Ignacio Zurita RojasAuthors Info & Claims
Alexandre da Silva Freire, Karla R. P. S. Lima, Diego Ignacio Zurita RojasAuthors Info & ClaimsArticle No.: 30, Pages 1 - 8
Abstract
In this work, we investigate an important problem from the biology field, which consists in searching for specific patterns, named motifs, in networks which represent certain biological interactions, such as metabolic networks, regulatory networks or Protein-Protein Interaction (PPI) networks. Two linear integer models are proposed, one of them using the concept of representatives. We present computational experiments made with instances generated from PPI networks with approximately 8.000 proteins and 29.000 interactions among them. As experimentally verified, the two proposed models were able to solve all instances in a very satisfactory amount of computational time.
References
[1]
Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, and Rolf Niedermeier. 2008. Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. In Combinatorial Pattern Matching, Paolo Ferragina and Gad M. Landau (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 31--43.
[2]
J.A. Bondy and U.S.R. Murty. 2008. Graph Theory. Springer.
[3]
Felipe Brigatto and Karla R. Lima. 2015. Desenvolvimento de uma Formulação Linear Inteira para o Problema de Motifs em Grafos. In II Workshop de Iniciação Científica em Sistemas de Informação -- XI Simpósio Brasileiro de Sistemas de Informação. 29--32.
[4]
Manoel Campêlo, Victor A. Campos, and Ricardo C. Corrêa. 2008. On the asymmetric representatives formulation for the vertex coloring problem. Discrete Applied Mathematics 156, 7 (2008), 1097--1111.
[5]
Manoel Campêlo, Alexandre S. Freire, Karla R. Lima, Phablo F. S. Moura, and Yoshiko Wakabayashi. 2016. The convex recoloring problem: polyhedra, facets and computational experiments. Mathematical Programming 156, 1 (2016), 303--330.
[6]
Rodolfo Carvajal, Miguel Constantino, Marcos Goycoolea, Juan Pablo Vielma, and Andrés Weintraub. 2013. Imposing Connectivity Constraints in Forest Planning Models. Operations Research 61, 4 (2013), 824--836. arXiv:https://doi.org/10.1287/opre.2013.1183
[7]
Sunil Chopra, Bartosz Filipecki, Kangbok Lee, Minseok Ryu, Sangho Shim, and Mathieu Van Vyve. 2017. An extended formulation of the convex recoloring problem on a tree. Mathematical Programming 165, 2 (01 Oct 2017), 529--548.
[8]
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms, Third Edition (3rd ed.). The MIT Press.
[9]
Yves Deville, David R. Gilbert, Jacques van Helden, and Shoshana J. Wodak. 2003. An overview of data models for the analysis of biochemical pathways. Briefings in Bioinformatics 4, 3 (2003), 246--259.
[10]
Riccardo Dondi, Guillaume Fertin, and Stéphane Vialette. 2007. Weak pattern matching in colored graphs: Minimizing the number of connected components. In 10th Italian Conference on Theoretical Computer Science (ICTCS 2007) (World-Scientific Conference Proceedings). World-Scientific Conference Proceedings, Rome, Italy, 27--38. https://hal.archives-ouvertes.fr/hal-00417910
[11]
Riccardo Dondi, Guillaume Fertin, and Stéphane Vialette. 2009. Maximum Motif Problem in Vertex-Colored Graphs. In Combinatorial Pattern Matching, Gregory Kucherov and Esko Ukkonen (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 221--235.
[12]
Riccardo Dondi, Guillaume Fertin, and Stéphane Vialette. 2013. Finding approximate and constrained motifs in graphs. Theoretical Computer Science 483 (2013), 10--21. https://doi.org/$http://dx.doi.org/10.1016/j.tcs.2012.08.023$ Special Issue Combinatorial Pattern Matching 2011.
[13]
Michael R. Fellows, Guillaume Fertin, Danny Hermelin, and Stéphane Vialette. 2007. Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. In ICALP (2007-09-03) (Lecture Notes in Computer Science), Lars Arge, Christian Cachin, Tomasz Jurdzinski, and Andrzej Tarlecki (Eds.), Vol. 4596. Springer, 340--351. http://dblp.uni-trier.de/db/conf/icalp/icalp2007.html#FellowsFHV07
[14]
Brian P. Kelley, Roded Sharan, Richard M. Karp, Taylor Sittler, David E. Root, Brent R. Stockwell, and Trey Ideker. 2003. Conserved pathways within bacteria and yeast as revealed by global protein network alignment. Proceedings of the National Academy of Sciences of the United States of America 100, 20 (30 Sept. 2003), 11394--11399.
[15]
Vincent Lacroix, Cristina G. Fernandes, and Marie-France Sagot. 2006. Motif Search in Graphs: Application to Metabolic Networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics 3, 4 (2006), 360--368.
[16]
Angela Makolo. 2016. A Comparative Analysis of Motif Discovery Algorithms. Computational Biology and Bioinformatics (2016).
[17]
Romeo Rizzi and Florian Sikora. 2015. Some results on more flexible versions of Graph Motif. Theory of Computing Systems 56, 4 (2015), 612--629.
[18]
Geir Kjetil Sandve and Finn Drablos. 2006. A survey of motif discovery methods in an integrated framework. Biology Direct (2006).
[19]
Laurence A. Wolsey. 1998. Integer Programming. Wiley - Interscience Series in Discrete Mathematics and Optimization.
Index Terms
- A System For Motif Search In Biological Networks
Recommendations
IPMM: Cancer Subtype Clustering Model Based on Multiomics Data and Pathway and Motif Information
Advanced Data Mining and ApplicationsAbstractMultiomics compiles data from different genome levels to study the effects of interactions between various omics molecules on disease processes. Integrated analysis of different omics data can more comprehensively evaluate their role in human ...
Counting motifs in probabilistic biological networks
BCB '15: Proceedings of the 6th ACM Conference on Bioinformatics, Computational Biology and Health InformaticsStudying the distribution of motifs in biological networks provides valuable insights about the key functions of these networks. Finding motifs in networks is however a computationally challenging task. This task is further complicated by the fact that ...
A cost-aggregating integer linear program for motif finding
In the motif finding problem one seeks a set of mutually similar substrings within a collection of biological sequences. This is an important and widely-studied problem, as such shared motifs in DNA often correspond to regulatory elements. We study a ...
Comments
Information & Contributors
Information
Published In
June 2018
578 pages
ISBN:9781450365598
DOI:10.1145/3229345
Copyright © 2018 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
In-Cooperation
- SIGAPP: ACM Special Interest Group on Applied Computing
- SIGMIS: ACM Special Interest Group on Management Information Systems
- SBC: Sociedade Brasileira de Computação
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 04 June 2018
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Funding Sources
Conference
SBSI'18
Acceptance Rates
Overall Acceptance Rate 181 of 557 submissions, 32%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 65Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 27 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in