Your browser doesn't support javascript.
loading
Mostrar: 20 | 50 | 100
Resultados 1 - 4 de 4
Filtrar
Mais filtros

Base de dados
Tipo de documento
Intervalo de ano de publicação
1.
J Bioinform Comput Biol ; 6(4): 825-42, 2008 Aug.
Artigo em Inglês | MEDLINE | ID: mdl-18763745

RESUMO

A large number of biological pathways have been elucidated recently, and there is a need for methods to analyze these pathways. One class of methods compares pathways semantically in order to discover parts that are evolutionarily conserved between species or to discover intraspecies similarities. Such methods usually require that the topologies of the pathways being compared are known, i.e. that a query pathway is being aligned to a model pathway. However, sometimes the query only consists of an unordered set of gene products. Previous methods for mapping sets of gene products onto known pathways have not been based on semantic comparison of gene products using ontologies or other abstraction hierarchies. Therefore, we here propose an approach that uses a similarity function defined in Gene Ontology (GO) terms to find semantic alignments when comparing paths in biological pathways where the nodes are gene products. A known pathway graph is used as a model, and an evolutionary algorithm (EA) is used to evolve putative paths from a set of experimentally determined gene products. The method uses a measure of GO term similarity to calculate a match score between gene products, and the fitness value of each candidate path alignment is derived from these match scores. A statistical test is used to assess the significance of evolved alignments. The performance of the method has been tested using regulatory pathways for S. cerevisiae and M. musculus.


Assuntos
Algoritmos , Bases de Dados de Proteínas , Evolução Molecular , Modelos Genéticos , Proteoma/genética , Transdução de Sinais/genética , Simulação por Computador , Armazenamento e Recuperação da Informação/métodos , Semântica
2.
Proteins ; 64(4): 948-59, 2006 Sep 01.
Artigo em Inglês | MEDLINE | ID: mdl-16794996

RESUMO

Advances in large-scale technologies in proteomics, such as yeast two-hybrid screening and mass spectrometry, have made it possible to generate large Protein Interaction Networks (PINs). Recent methods for identifying dense sub-graphs in such networks have been based solely on graph theoretic properties. Therefore, there is a need for an approach that will allow us to combine domain-specific knowledge with topological properties to generate functionally relevant sub-graphs from large networks. This article describes two alternative network measures for analysis of PINs, which combine functional information with topological properties of the networks. These measures, called weighted clustering coefficient and weighted average nearest-neighbors degree, use weights representing the strengths of interactions between the proteins, calculated according to their semantic similarity, which is based on the Gene Ontology terms of the proteins. We perform a global analysis of the yeast PIN by systematically comparing the weighted measures with their topological counterparts. To show the usefulness of the weighted measures, we develop an algorithm for identification of functional modules, called SWEMODE (Semantic WEights for MODule Elucidation), that identifies dense sub-graphs containing functionally similar proteins. The proposed method is based on the ranking of nodes, i.e., proteins, according to their weighted neighborhood cohesiveness. The highest ranked nodes are considered as seeds for candidate modules. The algorithm then iterates through the neighborhood of each seed protein, to identify densely connected proteins with high functional similarity, according to the chosen parameters. Using a yeast two-hybrid data set of experimentally determined protein-protein interactions, we demonstrate that SWEMODE is able to identify dense clusters containing proteins that are functionally similar. Many of the identified modules correspond to known complexes or subunits of these complexes.


Assuntos
Biologia Computacional , Substâncias Macromoleculares , Mapeamento de Interação de Proteínas , Proteômica , Algoritmos , Bases de Dados de Proteínas , Proteínas de Saccharomyces cerevisiae/química
3.
In Silico Biol ; 9(3): 65-76, 2009.
Artigo em Inglês | MEDLINE | ID: mdl-19795566

RESUMO

Biological systems are extremely complex and often involve thousands of interacting components. Despite all efforts, many complex biological systems are still poorly understood. However, over the past few years high-throughput technologies have generated large amounts of biological data, now requiring advanced bioinformatic algorithms for interpretation into valuable biological information. Due to these high-throughput technologies, the study of biological systems has evolved from focusing on single components (e.g. genes) to encompassing large sets of components (e.g. all genes in an entire genome), with the aim to elucidate their interdependences in various biological processes. In addition, there is also an increasing need for integrative analysis, where knowledge about the biological system is derived by data fusion, using heterogeneous data sets as input. We here review representative examples of bioinformatic methods for fusion-oriented interpretation of multiple heterogeneous biological data, and propose a classification into three categories of tasks that they address: data extraction, data integration and data fusion. The aim of this classification is to facilitate the exchange of methods between systems biology and other information fusion application areas.


Assuntos
Biologia Computacional/métodos , Biologia de Sistemas/métodos , Simulação por Computador , Sistemas de Gerenciamento de Base de Dados , Armazenamento e Recuperação da Informação/métodos , Proteômica/métodos
4.
Int J Bioinform Res Appl ; 4(3): 274-94, 2008.
Artigo em Inglês | MEDLINE | ID: mdl-18640904

RESUMO

We present a new method for semantic comparison of biological pathways, aiming to discover evolutionary conservation of pathways between species. Our method uses all three sub-ontologies of Gene Ontology (GO) and a measure of semantic similarity to calculate match scores between gene products. These scores are used for finding local pairwise pathway alignments. This approach has the advantage of being applicable to all types of pathways where nodes are gene products, e.g., regulatory pathways, signalling pathways and metabolic enzyme-to-enzyme pathways. We demonstrate the usefulness of the method using regulatory and metabolic pathways from E. coli and S. cerevisiae as examples.


Assuntos
Algoritmos , Modelos Biológicos , Proteoma/classificação , Proteoma/metabolismo , Transdução de Sinais/fisiologia , Software , Simulação por Computador , Semântica , Especificidade da Espécie
SELEÇÃO DE REFERÊNCIAS
DETALHE DA PESQUISA