22 research outputs found
Projected Power Iteration for Network Alignment
The network alignment problem asks for the best correspondence between two
given graphs, so that the largest possible number of edges are matched. This
problem appears in many scientific problems (like the study of protein-protein
interactions) and it is very closely related to the quadratic assignment
problem which has graph isomorphism, traveling salesman and minimum bisection
problems as particular cases. The graph matching problem is NP-hard in general.
However, under some restrictive models for the graphs, algorithms can
approximate the alignment efficiently. In that spirit the recent work by Feizi
and collaborators introduce EigenAlign, a fast spectral method with convergence
guarantees for Erd\H{o}s-Reny\'i graphs. In this work we propose the algorithm
Projected Power Alignment, which is a projected power iteration version of
EigenAlign. We numerically show it improves the recovery rates of EigenAlign
and we describe the theory that may be used to provide performance guarantees
for Projected Power Alignment.Comment: 8 page
Differential analysis of biological networks
In cancer research, the comparison of gene expression or DNA methylation
networks inferred from healthy controls and patients can lead to the discovery
of biological pathways associated to the disease. As a cancer progresses, its
signalling and control networks are subject to some degree of localised
re-wiring. Being able to detect disrupted interaction patterns induced by the
presence or progression of the disease can lead to the discovery of novel
molecular diagnostic and prognostic signatures. Currently there is a lack of
scalable statistical procedures for two-network comparisons aimed at detecting
localised topological differences. We propose the dGHD algorithm, a methodology
for detecting differential interaction patterns in two-network comparisons. The
algorithm relies on a statistic, the Generalised Hamming Distance (GHD), for
assessing the degree of topological difference between networks and evaluating
its statistical significance. dGHD builds on a non-parametric permutation
testing framework but achieves computationally efficiency through an asymptotic
normal approximation. We show that the GHD is able to detect more subtle
topological differences compared to a standard Hamming distance between
networks. This results in the dGHD algorithm achieving high performance in
simulation studies as measured by sensitivity and specificity. An application
to the problem of detecting differential DNA co-methylation subnetworks
associated to ovarian cancer demonstrates the potential benefits of the
proposed methodology for discovering network-derived biomarkers associated with
a trait of interest
DMPFinder - Finding differentiating pathways with gaps from two groups of metabolic networks
Session 2B: Biological and Regulatory NetworksWhy some strains of a species exhibit a certain phenotype (e.g. drug resistant) but not the other strains of the same species is a critical question to answer. Studying the metabolism of the two groups of strains may discover the corresponding pathways that are conserved in the first group but not in the second group. However, only a few tools provide functions to compare two groups of metabolic networks which are usually limited to the reaction level, not the pathway level. In this paper, we formulate the DMP (Differentiating Metabolic Pathway) problem for finding conserved pathways exist in first group, but not the second group. The problem also captures the mutation in pathways and derives a measure (p-value and e-score) for evaluating the confident of the pathways. We then developed an algorithm, DMPFinder, to solve the DMP problem. Experimental results show that DMPFinder is able to identify pathways that are critical for the first group to exhibit a certain phenotype which is absent in the other group. Some of these pathways cannot be identified by other tools which only consider reaction level or do not take into account possible mutations among species. The software is available at: http://i.cs.hku.hk/alse/hkubrg/projects/DMPFinder/postprintThe 3rd International Conference on Bioinformatics and Computational Biology (BICoB 2011), New Orleans, LA., 23-25 March 2011
Propagating semantic information in biochemical network models
<p>Abstract</p> <p>Background</p> <p>To enable automatic searches, alignments, and model combination, the elements of systems biology models need to be compared and matched across models. Elements can be identified by machine-readable biological annotations, but assigning such annotations and matching non-annotated elements is tedious work and calls for automation.</p> <p>Results</p> <p>A new method called "semantic propagation" allows the comparison of model elements based not only on their own annotations, but also on annotations of surrounding elements in the network. One may either propagate feature vectors, describing the annotations of individual elements, or quantitative similarities between elements from different models. Based on semantic propagation, we align partially annotated models and find annotations for non-annotated model elements.</p> <p>Conclusions</p> <p>Semantic propagation and model alignment are included in the open-source library semanticSBML, available on sourceforge. Online services for model alignment and for annotation prediction can be used at <url>http://www.semanticsbml.org</url>.</p
Effective Identification of Conserved Pathways in Biological Networks Using Hidden Markov Models
The advent of various high-throughput experimental techniques for measuring molecular interactions has enabled the systematic study of biological interactions on a global scale. Since biological processes are carried out by elaborate collaborations of numerous molecules that give rise to a complex network of molecular interactions, comparative analysis of these biological networks can bring important insights into the functional organization and regulatory mechanisms of biological systems.In this paper, we present an effective framework for identifying common interaction patterns in the biological networks of different organisms based on hidden Markov models (HMMs). Given two or more networks, our method efficiently finds the top matching paths in the respective networks, where the matching paths may contain a flexible number of consecutive insertions and deletions.Based on several protein-protein interaction (PPI) networks obtained from the Database of Interacting Proteins (DIP) and other public databases, we demonstrate that our method is able to detect biologically significant pathways that are conserved across different organisms. Our algorithm has a polynomial complexity that grows linearly with the size of the aligned paths. This enables the search for very long paths with more than 10 nodes within a few minutes on a desktop computer. The software program that implements this algorithm is available upon request from the authors
Retrieval, alignment, and clustering of computational models based on semantic annotations
As the number of computational systems biology models increases, new methods are needed to explore their content and build connections with experimental data. In this Perspective article, the authors propose a flexible semantic framework that can help achieve these aims
Metabolic pathway alignment between species using a comprehensive and flexible similarity measure
Comparative analysis of metabolic networks in multiple species yields important information on their evolution, and has great practical value in metabolic engineering, human disease analysis, drug design etc. In this work, we aim to systematically search for conserved pathways in two species, quantify their similarities, and focus on the variations between themElectrical Engineering, Mathematics and Computer Scienc
Biological network motif detection and evaluation
Background: Molecular level of biological data can be constructed into system level of data as biological networks. Network motifs are defined as over-represented small connected subgraphs in networks and they have been used for many biological applications. Since network motif discovery involves computationally challenging processes, previous algorithms have focused on computational efficiency. However, we believe that the biological quality of network motifs is also very important. Results: We define biological network motifs as biologically significant subgraphs and traditional network motifs are differentiated as structural network motifs in this paper. We develop five algorithms, namely, EDGEGO-BNM, EDGEBETWEENNESS-BNM, NMF-BNM, NMFGO-BNM and VOLTAGE-BNM, for efficient detection of biological network motifs, and introduce several evaluation measures including motifs included in complex, motifs included in functional module and GO term clustering score in this paper. Experimental results show that EDGEGO-BNM and EDGEBETWEENNESS-BNM perform better than existing algorithms and all of our algorithms are applicable to find structural network motifs as well. Conclusion: We provide new approaches to finding network motifs in biological networks. Our algorithms efficiently detect biological network motifs and further improve existing algorithms to find high quality structura