Analyzing Gene Interactions with Boolean Networks
Author Information
Author(s): Carlos H A Higa, Vitor H P Louzada, Tales P Andrade, Ronaldo F Hashimoto
Primary Institution: Institute of Mathematics and Statistics, University of Sao Paulo
Hypothesis
Can a restricted Boolean network model effectively analyze gene regulatory interactions using time-series data?
Conclusion
The proposed algorithm can infer gene relationships from time-series data of gene expression and can aid in detecting gene/protein interactions.
Supporting Evidence
- The algorithm was tested on artificial data from a yeast cell cycle model and on experimental data from HeLa cells.
- The results showed that the algorithm could identify both determined and partially determined connections between genes.
- Using biological knowledge improved the accuracy of the predictions in the HeLa cell data.
Takeaway
This study created a method to understand how genes interact by looking at their activity over time, helping scientists figure out which genes work together.
Methodology
The algorithm uses a restricted Boolean network model and time-series gene expression data to analyze gene interactions as a Constraint Satisfaction Problem.
Limitations
The study's results may be affected by noise in the data and the limited number of time points compared to the number of genes.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website