Title
Poster: Gene regulatory network inference using time lagged context likelihood of relatedness
Abstract
In our previous work [1], we have shown that time lags can be incorporated in information theory based metrics to further improve the efficiency of gene regulatory network inference. In particular, we have studied the mutual information metric where we found that mutual information saturates after a certain data size. We also proposed the time lagged mutual information metric and showed that the accuracy of inference algorithms using time lagged mutual information was better. Scalability of the proposed algorithm was an issue in our previous work. CLR is one of the popular algorithms which can infer very large networks. In this poster, we propose a time lagged version of the CLR algorithm.
Year
DOI
Venue
2011
10.1109/ICCABS.2011.5729890
ICCABS
Keywords
Field
DocType
context likelihood,inference algorithm,time lag,mutual information,gene regulatory network inference,mutual information saturates,previous work,information theory,proposed algorithm,clr algorithm,popular algorithm,gene regulatory network,genetics,molecular biophysics,relatedness,scalability,proteins,measurement
Data mining,Cellular biophysics,Computer science,Multivariate mutual information,Artificial intelligence,Information theory,Large networks,Inference,Mutual information,Bioinformatics,Gene regulatory network,Machine learning,Scalability
Conference
Citations 
PageRank 
References 
0
0.34
1
Authors
4
Name
Order
Citations
PageRank
Vijender Chaitankar1524.42
Preetam Ghosh234943.69
Mohamed O. Elasri3633.65
Edward J. Perkins422520.46