Abstract

RNA-seq has become the technology of choice for interrogating the transcriptome. However, most methods for RNA-seq differential expression (DE) analysis do not utilize prior knowledge of biological networks to detect DE genes. With the increased availability and quality of biological network databases, methods that can utilize this prior knowledge are needed and will offer biologists with a viable, more powerful alternative when analyzing RNA-seq data. We propose a three-state Markov Random Field (MRF) method that utilizes known biological pathways and interaction to improve sensitivity and specificity and therefore reducing false discovery rates (FDRs) when detecting differentially expressed genes from RNA-seq data. The method requires normalized count data (e.g. in Fragments or Reads Per Kilobase of transcript per Million mapped reads (FPKM/RPKM) format) as its input and it is implemented in an R package pathDESeq available from Github. Simulation studies demonstrate that our method outperforms the two-state MRF model for various sample sizes. Furthermore, for a comparable FDR, it has better sensitivity than DESeq, EBSeq, edgeR and NOISeq. The proposed method also picks more top Gene Ontology terms and KEGG pathways terms when applied to real dataset from colorectal cancer and hepatocellular carcinoma studies, respectively. Overall, these findings clearly highlight the power of our method relative to the existing methods that do not utilize prior knowledge of biological network. As an R package at https://github.com/MalathiSIDona/pathDESeq. install_github("MalathiSIDona/pathDESeq",build_vignettes = TRUE). After installation, type vignette("pathDESeq") to access the vignette. a.salim@latrobe.edu.au. Supplementary data are available at Bioinformatics online.

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.