A Haystack Heuristic for Autoimmune Disease Biomarker Discovery Using Next-Gen Immune Repertoire Sequencing Data.

Large-scale DNA sequencing of immunological repertoires offers an opportunity for the discovery of novel biomarkers for autoimmune disease. Available bioinformatics techniques however, are not adequately suited for elucidating possible biomarker candidates from within large immunosequencing datasets due to unsatisfactory scalability and sensitivity. Here, we present the Haystack Heuristic, an algorithm customized to computationally extract disease-associated motifs from next-generation-sequenced repertoires by contrasting disease and healthy subjects. This technique employs a local-search graph-theory approach to discover novel motifs in patient data. We apply the Haystack Heuristic to nine million B-cell receptor sequences obtained from nearly 100 individuals in order to elucidate a new motif that is significantly associated with multiple sclerosis. Our results demonstrate the effectiveness of the Haystack Heuristic in computing possible biomarker candidates from high throughput sequencing data and could be generalized to other datasets

Linking Cytoscape and the corynebacterial reference database CoryneRegNet

Baumbach J, Apeltsin L. Linking Cytoscape and the corynebacterial reference database CoryneRegNet. BMC Genomics. 2008;9(1): 184.Background: Recently, the research community has seen an influx of data relating to transcriptional regulatory interactions of Corynebacteria, organisms that are highly relevant to fields of systems biology, biotechnology, and human medicine. Information derived from DNA microarray experiments, computational predictions, and literature has opened the way for the graph-based analysis, visualization, and reconstruction of transcriptional regulatory networks across entire organisms. The reference database for corynebacterial gene regulatory networks CoryneRegNet provides methods for data storage and data exchange in a well-structured manner. Additional information on the model organism Escherichia coli KI2 obtained from RegulonDB has been integrated. Generally, gene regulatory networks can be visualized as graphs by drawing directed edges between nodes, where a node represents a gene and an edge corresponds to a typed regulatory interaction. Cytoscape is an open-source software project whose aim is to provide graph-based visualization and analysis for biological networks. Its architecture allows the development and integration of user-made plugins to enhance core functionalities. Results: We introduce two novel plugins for the Cytoscape environment designed to enhance in silico studies of procaryotic transcriptional regulatory networks. Our plugins leverage the information from the cornyebacterial reference database CoryneRegNet with the graph analysis capabilities of Cytoscape. CoryneRegNet Loader queries the CoryneRegNet database to extract a gene regulatory network represented as a directed graph. Additional information is stored as node/edge attributes within the graph. COMA facilitates consistency checks for gene expression studies given a gene regulatory network. COMA tests whether all gene expression levels correlate properly with the given network topology. Conclusion: The plugins facilitate in silico studies of procaryotic transcriptional gene regulation, particularly in Corynebacteria and E. coli, by combining the knowledge from the corynebacterial reference database with the graph analysis capabilities of Cytoscape, which is one of the mostwidely used tools for biological network analyses

BRIDGING MECHANICAL STIMULATION OF CELLULAR AND MOLECULAR STRUCTURE THROUGH LATTICE BASED COMPUTATIONAL SIMULATIONS

ABSTRACT Understanding the connection between mechanics and cell structure requires a critical exploration of molecular structure. One of these molecular bridges is known to be the cytoskeleton, which is involved with intracellular organization and mechanotransduction. In order to examine the structure in cells, we have developed a computational simulation that is able to probe the self-assembly of actin filaments through a lattice based Monte Carlo method. We have modeled the polymerization of these filaments based upon the interactions of globular actin through a probabilistic scheme with both inert and active proteins. The results show similar response to classic ordinary differential equations at low molecular concentrations, but a bi-phasic divergence at realistic concentrations for living mammalian cells. Further, these inert monomers have a limiting effect based upon their relative density ratios, which alter the polymerization process. Finally, by introducing localized mobility parameters, we are able to set up molecular gradients that are found in non-homogeneous protein distributions in vitro. This method and results have potential applications in cell and molecular biology as well as self assembly in inorganic systems

Computational strategies for dissecting the high-dimensional complexity of adaptive immune repertoires

The adaptive immune system recognizes antigens via an immense array of antigen-binding antibodies and T-cell receptors, the immune repertoire. The interrogation of immune repertoires is of high relevance for understanding the adaptive immune response in disease and infection (e.g., autoimmunity, cancer, HIV). Adaptive immune receptor repertoire sequencing (AIRR-seq) has driven the quantitative and molecular-level profiling of immune repertoires thereby revealing the high-dimensional complexity of the immune receptor sequence landscape. Several methods for the computational and statistical analysis of large-scale AIRR-seq data have been developed to resolve immune repertoire complexity in order to understand the dynamics of adaptive immunity. Here, we review the current research on (i) diversity, (ii) clustering and network, (iii) phylogenetic and (iv) machine learning methods applied to dissect, quantify and compare the architecture, evolution, and specificity of immune repertoires. We summarize outstanding questions in computational immunology and propose future directions for systems immunology towards coupling AIRR-seq with the computational discovery of immunotherapeutics, vaccines, and immunodiagnostics.Comment: 27 pages, 2 figure

clusterMaker: a multi-algorithm clustering plugin for Cytoscape

<p>Abstract</p> <p>Background</p> <p>In the post-genomic era, the rapid increase in high-throughput data calls for computational tools capable of integrating data of diverse types and facilitating recognition of biologically meaningful patterns within them. For example, protein-protein interaction data sets have been clustered to identify stable complexes, but scientists lack easily accessible tools to facilitate combined analyses of multiple data sets from different types of experiments. Here we present <it>clusterMaker</it>, a Cytoscape plugin that implements several clustering algorithms and provides network, dendrogram, and heat map views of the results. The Cytoscape network is linked to all of the other views, so that a selection in one is immediately reflected in the others. <it>clusterMaker </it>is the first Cytoscape plugin to implement such a wide variety of clustering algorithms and visualizations, including the only implementations of hierarchical clustering, dendrogram plus heat map visualization (tree view), k-means, k-medoid, SCPS, AutoSOME, and native (Java) MCL.</p> <p>Results</p> <p>Results are presented in the form of three scenarios of use: analysis of protein expression data using a recently published mouse interactome and a mouse microarray data set of nearly one hundred diverse cell/tissue types; the identification of protein complexes in the yeast <it>Saccharomyces cerevisiae</it>; and the cluster analysis of the vicinal oxygen chelate (VOC) enzyme superfamily. For scenario one, we explore functionally enriched mouse interactomes specific to particular cellular phenotypes and apply fuzzy clustering. For scenario two, we explore the prefoldin complex in detail using both physical and genetic interaction clusters. For scenario three, we explore the possible annotation of a protein as a methylmalonyl-CoA epimerase within the VOC superfamily. Cytoscape session files for all three scenarios are provided in the Additional Files section.</p> <p>Conclusions</p> <p>The Cytoscape plugin <it>clusterMaker </it>provides a number of clustering algorithms and visualizations that can be used independently or in combination for analysis and visualization of biological data sets, and for confirming or generating hypotheses about biological function. Several of these visualizations and algorithms are only available to Cytoscape users through the <it>clusterMaker </it>plugin. <it>clusterMaker </it>is available via the Cytoscape plugin manager.</p

Assessing the functional coherence of modules found in multiple-evidence networks from Arabidopsis

<p>Abstract</p> <p>Background</p> <p>Combining multiple evidence-types from different information sources has the potential to reveal new relationships in biological systems. The integrated information can be represented as a relationship network, and clustering the network can suggest possible functional modules. The value of such modules for gaining insight into the underlying biological processes depends on their functional coherence. The challenges that we wish to address are to define and quantify the functional coherence of modules in relationship networks, so that they can be used to infer function of as yet unannotated proteins, to discover previously unknown roles of proteins in diseases as well as for better understanding of the regulation and interrelationship between different elements of complex biological systems.</p> <p>Results</p> <p>We have defined the functional coherence of modules with respect to the Gene Ontology (GO) by considering two complementary aspects: (i) the fragmentation of the GO functional categories into the different modules and (ii) the most representative functions of the modules. We have proposed a set of metrics to evaluate these two aspects and demonstrated their utility in <it>Arabidopsis thaliana</it>. We selected 2355 proteins for which experimentally established protein-protein interaction (PPI) data were available. From these we have constructed five relationship networks, four based on single types of data: PPI, co-expression, co-occurrence of protein names in scientific literature abstracts and sequence similarity and a fifth one combining these four evidence types. The ability of these networks to suggest biologically meaningful grouping of proteins was explored by applying Markov clustering and then by measuring the functional coherence of the clusters.</p> <p>Conclusions</p> <p>Relationship networks integrating multiple evidence-types are biologically informative and allow more proteins to be assigned to a putative functional module. Using additional evidence types concentrates the functional annotations in a smaller number of modules without unduly compromising their consistency. These results indicate that integration of more data sources improves the ability to uncover functional association between proteins, both by allowing more proteins to be linked and producing a network where modular structure more closely reflects the hierarchy in the gene ontology.</p

Exploring the Protein Universe from General Principles

This dissertation is concerned with the construction and validation of an organizational framework for processing large protein sequence datasets. The framework relies on the accurate clustering of input sequences into functionally similar families. We demonstrate how the quality of output for existing protein clustering techniques may be improved by running a simple edge weight selection heuristic prior to clustering. Once clustering is completed, we are able to topologically organize the data by treating each cluster as a node in a network and searching for the union of minimum spanning trees that reconnects the clusters to each other. When thusly organized, the topological relationships between neighboring clusters exhibit properties similar to evolutionary relationships computed from phylogenetic models. We demonstrate how these topological relationships may be used to algorithmically identify the functionally significant residues within the sequences in the organized dataset. This predictive capacity of the organizational framework serves as a quantitative metric for validating the framework's biological significance

Exploring the Protein Universe from General Principles

This dissertation is concerned with the construction and validation of an organizational framework for processing large protein sequence datasets. The framework relies on the accurate clustering of input sequences into functionally similar families. We demonstrate how the quality of output for existing protein clustering techniques may be improved by running a simple edge weight selection heuristic prior to clustering. Once clustering is completed, we are able to topologically organize the data by treating each cluster as a node in a network and searching for the union of minimum spanning trees that reconnects the clusters to each other. When thusly organized, the topological relationships between neighboring clusters exhibit properties similar to evolutionary relationships computed from phylogenetic models. We demonstrate how these topological relationships may be used to algorithmically identify the functionally significant residues within the sequences in the organized dataset. This predictive capacity of the organizational framework serves as a quantitative metric for validating the framework's biological significance