petal - A New Approach to Construct and Analyze Gene Co-Expression Networks in R

Loading...
Thumbnail Image

Authors

Petereit, Julia

Issue Date

2016

Type

Dissertation

Language

Keywords

complex networks , parammeter-free algorithm , R , scale-free , small-world , whole-omics approach

Research Projects

Organizational Units

Journal Issue

Alternative Title

Abstract

petal is a network analysis method that includes and takes advantage of precise Mathematics, Statistics, and Graph Theory, but remains practical to the life scientist. petal is built upon the assumption that large complex systems follow a scale-free and small-world network topology. One main intention of creating this program is to eliminate unnecessary noise and imprecision introduced by the user. Consequently, no user input parameters are required, and the program is designed to allow the two structural properties, scale-free and small-world, to govern the construction of network models.The program is implemented in the statistical language R and is freely available as a package for download. Its package includes several simple R functions that the researcher can use to construct co-expression networks and extract gene groupings from a biologically meaningful network model. More advanced R users may use other functions for further downstream analyses, if desired. The petal algorithm is discussed and its application demonstrated on several datasets. petal results show that the technique is capable of detecting biologically meaningful network modules from co-expression networks. That is, scientists can use this technique to identify groups of genes with possible similar function based on their expression information.While this approach is motivated by whole-system gene expression data, the fundamental components of the method are transparent and can be applied to large datasets of many types, sizes, and stemming from various fields.

Description

Citation

Publisher

License

In Copyright(All Rights Reserved)

Journal

Volume

Issue

PubMed ID

DOI

ISSN

EISSN