Abstract

Research on gene co-expression not only plays an important role in understanding the complex regulatory relationships, but also contributes to our understanding of gene regulatory network. Beyond the co-expression knowledge between two genes, investigating the co-expression relationships among multiple target genes is more informative for understanding the basic working mechanisms in a cell. In this paper, all the Arabidopsis anther genes and every gene's potential co-expressed partners are collected by cross-database search. By combining simple pair gene co-expression networks, a complex Arabidopsis anther co-expression network is constructed. Maximum-clique algorithm is then applied to mine the groups reflecting co-expression relationships among multiple Arabidopsis anther genes that are represented by completely connected graphs. As a result, 254 Arabidopsis anther complete co-expression groups are obtained and our analysis shows that all the genes in the same group have high propensity to be functionally related and co-expressed together. We also demonstrate the efficacy of the proposed maximum-clique algorithm by comparing its results with the known Arabidopsis genome pathways, K-means clustering algorithm derived results and randomized data. It is expected that the 254 Arabidopsis anther complete co-expression groups generated in this paper can be a valuable knowledge source for further studies of molecular mechanisms of anther and its transcription regulations.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.