Comparison of motifs detection methods in biological networks

• Grant number: 19/00299-2
• Support Opportunities: Scholarships in Brazil - Scientific Initiation
• Start date: March 01, 2019
• End date: February 29, 2020
• Field of knowledge: Physical Sciences and Mathematics - Computer Science
• Principal Investigator: Guilherme Oliveira Mota
• Grantee: Fabio Luis Arruda Fernandes
• Host Institution: Centro de Matemática, Computação e Cognição (CMCC). Universidade Federal do ABC (UFABC). Ministério da Educação (Brasil). Santo André , SP, Brazil
• Associated research grant: 18/04876-1 - Ramsey theory, structural graph theory and applications in Bioinformatics, AP.JP

Abstract

Algorithms to identify and find motifs include accurate counting and approximation algorithms. For efficient detection of motifs, several approximation algorithms have been developed. Given the variety of existing algorithms for finding motifs in biological networks, in this project we aim to perform a comparative analysis of several algorithms for detecting motifs, which are small connected subgraphs that occur with significant frequency in a network. In this project we plan the study of basic concepts of systemic biology and graph theory, followed by the exploration of algorithms for searching motifs. In the second stage of the project we plan to compare motifs detection algorithms in biological networks.