Joseph Nalluri
ABSTRACT
Exploring miRNA-disease interactions is critical to identify the impact of a disease on other diseases. Mapping this problem to a graph theoretical concept offers a unique perspective to study unseen relationships among diseases. In our work, maximum weighted matching has been used after mapping the miRNA-disease associations as a bipartite graph. We also address the limitation of this approach using disease ranking scheme and the results are presented.
- A. S. Asratian. Bipartite graphs and their applications. Number 131. Cambridge University Press, 1998. Google Scholar
Digital Library
- S. C. Fang. ISE/OR/MA 766 network flows - lecture notes. 2012.Google Scholar
- A. Makhorin. GNU linear programming kit. Moscow Aviation Institute, Moscow, Russia, 38, 2001.Google Scholar
- Q. Yang, C. Qiu, J. Yang, Q. Wu, and Q. Cui. mirenvironment database: providing a bridge for micrornas, environmental factors and phenotypes. Bioinformatics, 27(23):3329--3330, 2011. Google ScholarDigital Library
Index Terms
- Determining miRNA-disease associations using bipartite graph modelling
Recommendations
Equistarable bipartite graphs
Recently, Milanič and Trotignon introduced the class of equistarable graphs as graphs without isolated vertices admitting positive weights on the edges such that a subset of edges is of total weight 1 if and only if it forms a maximal star. Based on ...
Unraveling multiple miRNA-mRNA associations through a graph-based approach
BCB '12: Proceedings of the ACM Conference on Bioinformatics, Computational Biology and BiomedicinemiRNAs are fragments of non-coding RNA that play a key role in mRNA regulation. Unfortunately complex relations among miRNAs and mRNAs remain still unclear, although there is a substantial agreement on the fact that miRNA are regulator of the mRNA ...
Hamiltonian and long paths in bipartite graphs with connectivity
AbstractLet G be a graph, ν ( G ) the order of G, κ ( G ) the connectivity of G and k a positive integer such that k ≤ ( ν ( G ) − 2 ) / 2. Then G is said to be k-extendable if it has a matching of size k and every matching of size k extends ...
Comments