OrthoClust: an orthology-based network framework for clustering data across multiple species

Increasingly, high-dimensional genomics data are becoming available for many organisms.Here, we develop OrthoClust for simultaneously clustering data across multiple species. OrthoClust is a computational framework that integrates the co-association networks of individual species by utilizing the orthology relationships of genes between species. It outputs optimized modules that are fundamentally cross-species, which can either be conserved or species-specific. We demonstrate the application of OrthoClust using the RNA-Seq expression profiles of Caenorhabditis elegans and Drosophila melanogaster from the modENCODE consortium. A potential application of cross-species modules is to infer putative analogous functions of uncharacterized elements like non-coding RNAs based on guilt-by-association.

Electronic supplementary material

The online version of this article (doi:10.1186/gb-2014-15-8-r100) contains supplementary material, which is available to authorized users.     

A statistical framework for differential network analysis from microarray data

Background  

It has been long well known that genes do not act alone; rather groups of genes act in consort during a biological process. Consequently, the expression levels of genes are dependent on each other. Experimental techniques to detect such interacting pairs of genes have been in place for quite some time. With the advent of microarray technology, newer computational techniques to detect such interaction or association between gene expressions are being proposed which lead to an association network. While most microarray analyses look for genes that are differentially expressed, it is of potentially greater significance to identify how entire association network structures change between two or more biological settings, say normal versus diseased cell types.     

Cytoscape 2.8: new features for data integration and network visualization

Cytoscape is a popular bioinformatics package for biological network visualization and data integration. Version 2.8 introduces two powerful new features--Custom Node Graphics and Attribute Equations--which can be used jointly to greatly enhance Cytoscape's data integration and visualization capabilities. Custom Node Graphics allow an image to be projected onto a node, including images generated dynamically or at remote locations. Attribute Equations provide Cytoscape with spreadsheet-like functionality in which the value of an attribute is computed dynamically as a function of other attributes and network properties. Availability and implementation: Cytoscape is a desktop Java application released under the Library Gnu Public License (LGPL). Binary install bundles and source code for Cytoscape 2.8 are available for download from http://cytoscape.org.     

A unified framework for unraveling the functional interaction structure of a biomolecular network based on stimulus-response experimental data

We propose a unified framework for the identification of functional interaction structures of biomolecular networks in a way that leads to a new experimental design procedure. In developing our approach, we have built upon previous work. Thus we begin by pointing out some of the restrictions associated with existing structure identification methods and point out how these restrictions may be eased. In particular, existing methods use specific forms of experimental algebraic equations with which to identify the functional interaction structure of a biomolecular network. In our work, we employ an extended form of these experimental algebraic equations which, while retaining their merits, also overcome some of their disadvantages. Experimental data are required in order to estimate the coefficients of the experimental algebraic equation set associated with the structure identification task. However, experimentalists are rarely provided with guidance on which parameters to perturb, and to what extent, to perturb them. When a model of network dynamics is required then there is also the vexed question of sample rate and sample time selection to be resolved. Supplying some answers to these questions is the main motivation of this paper. The approach is based on stationary and/or temporal data obtained from parameter perturbations, and unifies the previous approaches of Kholodenko et al. (PNAS 99 (2002) 12841-12846) and Sontag et al. (Bioinformatics 20 (2004) 1877-1886). By way of demonstration, we apply our unified approach to a network model which cannot be properly identified by existing methods. Finally, we propose an experiment design methodology, which is not limited by the amount of parameter perturbations, and illustrate its use with an in numero example.     

Similarity measures for structured data: a general framework and some applications to vegetation data

Although there are many measures of similarity existing in the phytosociological literature, these almost all apply to data for which the describing attributes have only single values. In many cases, however, there can be a richer structure in the attribute values, either directly from the nature of the attributes or derived from relationships between the stands. In this paper, I first examine a range of possible sources of such structure in phytosociological data, and then propose a similarity measure sufficiently general to be applicable to all the variant types. Finally I present some examples of applying such measures to frequency data from tropical grasslands and to successional data from subtropical rain forest.     

Exploiting the conformational flexibility of leghemoglobin: a framework for examination of heme protein axial ligation

We have exploited the intrinsic conformational flexibility of leghemoglobin to reengineer the heme active site architecture of the molecule by replacement of the mobile His61 residue with tyrosine (H61Y variant). The electronic absorption spectrum of the ferric derivative of H61Y is similar to that observed for the phenolate derivative of the recombinant wild-type protein (rLb), consistent with coordination of Tyr61 to (high-spin) iron. EXAFS data clearly indicate a 6-coordinate heme geometry and a Fe-O bond length of 185pm. MCD and EPR spectroscopies are consistent with this assignment and support ligation by an anionic (tyrosinate) group. The alteration in heme ligation leads to a 148mV decrease in the reduction potential for H61Y (-127+/-5mV) compared to rLb and destabilisation of the functional oxy-derivative. The results are discussed in terms of our wider understanding of other heme proteins with His-Tyr ligation.     

MicroPreP: a cDNA microarray data pre-processing framework

The user-friendly MicroPreP framework was developed to transform raw intensity data from cDNA microarrays into high-quality data. The main features of this software are: LOWESS normalisation; merging of DNA microarray data from changing slide versions; outlier detection; and slide quality assessment.     

Towards a matrix mechanics framework for dynamic protein network

Protein–protein interaction networks are currently visualized by software generated interaction webs based upon static experimental data. Current state is limited to static, mostly non-compartmental network and non time resolved protein interactions. A satisfactory mathematical foundation for particle interactions within a viscous liquid state (situation within the cytoplasm) does not exist nor do current computer programs enable building dynamic interaction networks for time resolved interactions. Building mathematical foundation for intracellular protein interactions can be achieved in two increments (a) trigger and capture the dynamic molecular changes for a select subset of proteins using several model systems and high throughput time resolved proteomics and, (b) use this information to build the mathematical foundation and computational algorithm for a compartmentalized and dynamic protein interaction network. Such a foundation is expected to provide benefit in at least two spheres: (a) understanding physiology enabling explanation of phenomenon such as incomplete penetrance in genetic disorders and (b) enabling several fold increase in biopharmaceutical production using impure starting materials.     

ExpressionPlot: a web-based framework for analysis of RNA-Seq and microarray gene expression data

RNA-Seq and microarray platforms have emerged as important tools for detecting changes in gene expression and RNA processing in biological samples. We present ExpressionPlot, a software package consisting of a default back end, which prepares raw sequencing or Affymetrix microarray data, and a web-based front end, which offers a biologically centered interface to browse, visualize, and compare different data sets. Download and installation instructions, a user's manual, discussion group, and a prototype are available at .     

Inherent intractability of the ascertainment problem for pedigree data: a general likelihood framework.

The problem of ascertainment in segregation analysis arises when families are selected for study through ascertainment of affected individuals. In this case, ascertainment must be corrected for in data analysis. However, methods for ascertainment correction are not available for many common sampling schemes, e.g., sequential sampling of extended pedigrees (except in the case of "single" selection). Concerns about whether ascertainment correction is even required for large pedigrees, about whether and how multiple probands in the same pedigree can be taken into account properly, and about how to apply sequential sampling strategies have occupied many investigators in recent years. We address these concerns by reconsidering a central issue, namely, how to handle pedigree structure (including size). We introduce a new distinction, between sampling in such a way that observed pedigree structure does not depend on which pedigree members are probands (proband-independent [PI] sampling) and sampling in such a way that observed pedigree structure does depend on who are the probands (proband-dependent [PD] sampling). This distinction corresponds roughly (but not exactly) to the distinction between fixed-structure and sequential sampling. We show that conditioning on observed pedigree structure in ascertained data sets obtained under PD sampling is not in general correct (with the exception of "single" selection), while PI sampling of pedigree structures larger than simple sibships is generally not possible. Yet, in practice one has little choice but to condition on observed pedigree structure. We conclude that the problem of genetic modeling in ascertained data sets is, in most situations, literally intractable. We recommend that future efforts focus on the development of robust approximate approaches to the problem.     

Kavosh: a new algorithm for finding network motifs

Background  

Complex networks are studied across many fields of science and are particularly important to understand biological processes. Motifs in networks are small connected sub-graphs that occur significantly in higher frequencies than in random networks. They have recently gathered much attention as a useful concept to uncover structural design principles of complex networks. Existing algorithms for finding network motifs are extremely costly in CPU time and memory consumption and have practically restrictions on the size of motifs.     

Investigating early hominin dispersal patterns: developing a framework for climate data integration

An investigation using the Stepping Out model of early hominin dispersal out of Africa is presented here. The late arrival of early hominins into Europe, as deduced from the fossil record, is shown to be consistent with poor ability of these hominins to survive in the Eurasian landscape. The present study also extends the understanding of modelling results from the original study by Mithen and Reed (2002. Stepping out: a computer simulation of hominid dispersal from Africa. J. Hum. Evol. 43, 433-462). The representation of climate and vegetation patterns has been improved through the use of climate model output. This study demonstrates that interpretative confidence may be strengthened, and new insights gained when climate models and hominin dispersal models are integrated.     

SPRINT: A new parallel framework for R

Background  

Microarray analysis allows the simultaneous measurement of thousands to millions of genes or sequences across tens to thousands of different samples. The analysis of the resulting data tests the limits of existing bioinformatics computing infrastructure. A solution to this issue is to use High Performance Computing (HPC) systems, which contain many processors and more memory than desktop computer systems. Many biostatisticians use R to process the data gleaned from microarray analysis and there is even a dedicated group of packages, Bioconductor, for this purpose. However, to exploit HPC systems, R must be able to utilise the multiple processors available on these systems. There are existing modules that enable R to use multiple processors, but these are either difficult to use for the HPC novice or cannot be used to solve certain classes of problems. A method of exploiting HPC systems, using R, but without recourse to mastering parallel programming paradigms is therefore necessary to analyse genomic data to its fullest.     

Enzyme kinetics: a new procedure for data normalization

A procedure is proposed to normalize enzymatic reaction velocities measured in separate experiments. After calculation of the Km and maximum velocity in each individual set of data, the velocities measured in each experiment are reanalyzed by regression analysis with the constraint that they yield a Km identical to the geometric mean of the individual Km's calculated originally. The V derived from this second analysis can be taken, in each experiment, as the reference value relative to which all reaction velocities are normalized. All normalized velocities are eventually pooled together to establish the final regression line. This relatively simple and reliable procedure overcomes several difficulties otherwise encountered when the kinetics of an enzymatic reaction are judged from data collected in separate experiments.     

Computation of elementary modes: a unifying framework and the new binary approach

Background  

Metabolic pathway analysis has been recognized as a central approach to the structural analysis of metabolic networks. The concept of elementary (flux) modes provides a rigorous formalism to describe and assess pathways and has proven to be valuable for many applications. However, computing elementary modes is a hard computational task. In recent years we assisted in a multiplication of algorithms dedicated to it. We require a summarizing point of view and a continued improvement of the current methods.