首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.

Background

Proteins dynamically interact with each other to perform their biological functions. The dynamic operations of protein interaction networks (PPI) are also reflected in the dynamic formations of protein complexes. Existing protein complex detection algorithms usually overlook the inherent temporal nature of protein interactions within PPI networks. Systematically analyzing the temporal protein complexes can not only improve the accuracy of protein complex detection, but also strengthen our biological knowledge on the dynamic protein assembly processes for cellular organization.

Results

In this study, we propose a novel computational method to predict temporal protein complexes. Particularly, we first construct a series of dynamic PPI networks by joint analysis of time-course gene expression data and protein interaction data. Then a Time Smooth Overlapping Complex Detection model (TS-OCD) has been proposed to detect temporal protein complexes from these dynamic PPI networks. TS-OCD can naturally capture the smoothness of networks between consecutive time points and detect overlapping protein complexes at each time point. Finally, a nonnegative matrix factorization based algorithm is introduced to merge those very similar temporal complexes across different time points.

Conclusions

Extensive experimental results demonstrate the proposed method is very effective in detecting temporal protein complexes than the state-of-the-art complex detection techniques.

Electronic supplementary material

The online version of this article (doi:10.1186/1471-2105-15-335) contains supplementary material, which is available to authorized users.  相似文献   

2.
Sîrbu A  Ruskin HJ  Crane M 《PloS one》2010,5(11):e13822

Background

Inferring Gene Regulatory Networks (GRNs) from time course microarray data suffers from the dimensionality problem created by the short length of available time series compared to the large number of genes in the network. To overcome this, data integration from diverse sources is mandatory. Microarray data from different sources and platforms are publicly available, but integration is not straightforward, due to platform and experimental differences.

Methods

We analyse here different normalisation approaches for microarray data integration, in the context of reverse engineering of GRN quantitative models. We introduce two preprocessing approaches based on existing normalisation techniques and provide a comprehensive comparison of normalised datasets.

Conclusions

Results identify a method based on a combination of Loess normalisation and iterative K-means as best for time series normalisation for this problem.  相似文献   

3.
4.
5.

Background

A goal of systems biology is to analyze large-scale molecular networks including gene expressions and protein-protein interactions, revealing the relationships between network structures and their biological functions. Dividing a protein-protein interaction (PPI) network into naturally grouped parts is an essential way to investigate the relationship between topology of networks and their functions. However, clear modular decomposition is often hard due to the heterogeneous or scale-free properties of PPI networks.

Methodology/Principal Findings

To address this problem, we propose a diffusion model-based spectral clustering algorithm, which analytically solves the cluster structure of PPI networks as a problem of random walks in the diffusion process in them. To cope with the heterogeneity of the networks, the power factor is introduced to adjust the diffusion matrix by weighting the transition (adjacency) matrix according to a node degree matrix. This algorithm is named adjustable diffusion matrix-based spectral clustering (ADMSC). To demonstrate the feasibility of ADMSC, we apply it to decomposition of a yeast PPI network, identifying biologically significant clusters with approximately equal size. Compared with other established algorithms, ADMSC facilitates clear and fast decomposition of PPI networks.

Conclusions/Significance

ADMSC is proposed by introducing the power factor that adjusts the diffusion matrix to the heterogeneity of the PPI networks. ADMSC effectively partitions PPI networks into biologically significant clusters with almost equal sizes, while being very fast, robust and appealing simple.  相似文献   

6.

Background

Sepsis causes extensive morbidity and mortality in children worldwide. Prompt recognition and timely treatment of sepsis is critical in reducing morbidity and mortality. Genomic approaches are used to discover novel pathways, therapeutic targets and biomarkers. These may facilitate diagnosis and risk stratification to tailor treatment strategies.

Objective

To investigate the temporal gene expression during the evolution of sepsis induced multi-organ failure in response to a single organism, Neisseria meningitidis, in previously healthy children.

Method

RNA was extracted from serial blood samples (6 time points over 48 hours from presentation) from five critically ill children with meningococcal sepsis. Extracted RNA was hybridized to Affymetrix arrays. The RNA underwent strict quality control and standardized quantitation. Gene expression results were analyzed using GeneSpring software and Ingenuity Pathway Analysis.

Result

A marked variability in differential gene expression was observed between time points and between patients revealing dynamic expression changes during the evolution of sepsis. While there was evidence of time-dependent changes in expected gene networks including those involving immune responses and inflammatory pathways, temporal variation was also evident in specific “biomarkers” that have been proposed for diagnostic and risk stratification functions. The extent and nature of this variability was not readily explained by clinical phenotype.

Conclusion

This is the first study of its kind detailing extensive expression changes in children during the evolution of sepsis. This highlights a limitation of static or single time point biomarker estimation. Serial estimations or more comprehensive network approaches may be required to optimize risk stratification in complex, time-critical conditions such as evolving sepsis.  相似文献   

7.

Background

Gene Regulatory Networks (GRNs) have become a major focus of interest in recent years. Elucidating the architecture and dynamics of large scale gene regulatory networks is an important goal in systems biology. The knowledge of the gene regulatory networks further gives insights about gene regulatory pathways. This information leads to many potential applications in medicine and molecular biology, examples of which are identification of metabolic pathways, complex genetic diseases, drug discovery and toxicology analysis. High-throughput technologies allow studying various aspects of gene regulatory networks on a genome-wide scale and we will discuss recent advances as well as limitations and future challenges for gene network modeling. Novel approaches are needed to both infer the causal genes and generate hypothesis on the underlying regulatory mechanisms.

Methodology

In the present article, we introduce a new method for identifying a set of optimal gene regulatory pathways by using structural equations as a tool for modeling gene regulatory networks. The method, first of all, generates data on reaction flows in a pathway. A set of constraints is formulated incorporating weighting coefficients. Finally the gene regulatory pathways are obtained through optimization of an objective function with respect to these weighting coefficients. The effectiveness of the present method is successfully tested on ten gene regulatory networks existing in the literature. A comparative study with the existing extreme pathway analysis also forms a part of this investigation. The results compare favorably with earlier experimental results. The validated pathways point to a combination of previously documented and novel findings.

Conclusions

We show that our method can correctly identify the causal genes and effectively output experimentally verified pathways. The present method has been successful in deriving the optimal regulatory pathways for all the regulatory networks considered. The biological significance and applicability of the optimal pathways has also been discussed. Finally the usefulness of the present method on genetic engineering is depicted with an example.  相似文献   

8.
9.
10.

Background

Community structure is one of the key properties of complex networks and plays a crucial role in their topology and function. While an impressive amount of work has been done on the issue of community detection, very little attention has been so far devoted to the investigation of communities in real networks.

Methodology/Principal Findings

We present a systematic empirical analysis of the statistical properties of communities in large information, communication, technological, biological, and social networks. We find that the mesoscopic organization of networks of the same category is remarkably similar. This is reflected in several characteristics of community structure, which can be used as “fingerprints” of specific network categories. While community size distributions are always broad, certain categories of networks consist mainly of tree-like communities, while others have denser modules. Average path lengths within communities initially grow logarithmically with community size, but the growth saturates or slows down for communities larger than a characteristic size. This behaviour is related to the presence of hubs within communities, whose roles differ across categories. Also the community embeddedness of nodes, measured in terms of the fraction of links within their communities, has a characteristic distribution for each category.

Conclusions/Significance

Our findings, verified by the use of two fundamentally different community detection methods, allow for a classification of real networks and pave the way to a realistic modelling of networks'' evolution.  相似文献   

11.
12.

Purpose

We investigated the effect of handgrip (HG) maneuver on time-varying estimates of dynamic cerebral autoregulation (CA) using the autoregressive moving average technique.

Methods

Twelve healthy subjects were recruited to perform HG maneuver during 3 minutes with 30% of maximum contraction force. Cerebral blood flow velocity, end-tidal CO2 pressure (PETCO2), and noninvasive arterial blood pressure (ABP) were continuously recorded during baseline, HG and recovery. Critical closing pressure (CrCP), resistance area-product (RAP), and time-varying autoregulation index (ARI) were obtained.

Results

PETCO2 did not show significant changes during HG maneuver. Whilst ABP increased continuously during the maneuver, to 27% above its baseline value, CBFV raised to a plateau approximately 15% above baseline. This was sustained by a parallel increase in RAP, suggestive of myogenic vasoconstriction, and a reduction in CrCP that could be associated with metabolic vasodilation. The time-varying ARI index dropped at the beginning and end of the maneuver (p<0.005), which could be related to corresponding alert reactions or to different time constants of the myogenic, metabolic and/or neurogenic mechanisms.

Conclusion

Changes in dynamic CA during HG suggest a complex interplay of regulatory mechanisms during static exercise that should be considered when assessing the determinants of cerebral blood flow and metabolism.  相似文献   

13.

Background

Although focal epilepsies are increasingly recognized to affect multiple and remote neural systems, the underlying spatiotemporal pattern and the relationships between recurrent spontaneous seizures, global functional connectivity, and structural integrity remain largely unknown.

Methodology/Principal Findings

Here we utilized serial resting-state functional MRI, graph-theoretical analysis of complex brain networks and diffusion tensor imaging to characterize the evolution of global network topology, functional connectivity and structural changes in the interictal brain in relation to focal epilepsy in a rat model. Epileptic networks exhibited a more regular functional topology than controls, indicated by a significant increase in shortest path length and clustering coefficient. Interhemispheric functional connectivity in epileptic brains decreased, while intrahemispheric functional connectivity increased. Widespread reductions of fractional anisotropy were found in white matter regions not restricted to the vicinity of the epileptic focus, including the corpus callosum.

Conclusions/Significance

Our longitudinal study on the pathogenesis of network dynamics in epileptic brains reveals that, despite the locality of the epileptogenic area, epileptic brains differ in their global network topology, connectivity and structural integrity from healthy brains.  相似文献   

14.

Background

Tuberculosis (TB) in prisons is a major health problem in countries of high and intermediate TB endemicity such as Brazil. For operational reasons, TB control strategies in prisons cannot be compared through population based intervention studies.

Methodology/Principal Findings

A mathematical model is proposed to simulate the TB dynamics in prison and evaluate the potential impact on active TB prevalence of several intervention strategies. The TB dynamics with the ongoing program was simulated over a 10 year period in a Rio de Janeiro prison (TB prevalence 4.6 %). Then, a simulation of the DOTS strategy reaching the objective of 70 % of bacteriologically-positive cases detected and 85 % of detected cases cured was performed; this strategy reduced only to 2.8% the average predicted TB prevalence after 5 years. Adding TB detection at entry point to DOTS strategy had no major effect on the predicted active TB prevalence. But, adding further a yearly X-ray mass screening of inmates reduced the predicted active TB prevalence below 1%. Furthermore, according to this model, after applying this strategy during 2 years (three annual screenings), the TB burden would be reduced and the active TB prevalence could be kept at a low level by associating X-ray screening at entry point and DOTS.

Conclusions/Significance

We have shown that X-ray mass screenings should be considered to control TB in highly endemic prison. Prisons with different levels of TB prevalence could be examined thanks to this model which provides a rational tool for public health deciders.  相似文献   

15.
Matrajt L  Longini IM 《PloS one》2010,5(11):e13767

Background

Pandemic influenza A(H1N1) 2009 began spreading around the globe in April of 2009 and vaccination started in October of 2009. In most countries, by the time vaccination started, the second wave of pandemic H1N1 2009 was already under way. With limited supplies of vaccine, we are left to question whether it may be a good strategy to vaccinate the high-transmission groups earlier in the epidemic, but it might be a better use of resources to protect instead the high-risk groups later in the epidemic. To answer this question, we develop a deterministic epidemic model with two age-groups (children and adults) and further subdivide each age group in low and high risk.

Methods and Findings

We compare optimal vaccination strategies started at various points in time in two different settings: a population in a developed country where children account for 24% of the population, and a population in a less developed country where children make up the majority of the population, 55%. For each of these populations, we minimize mortality or hospitalizations and we find an optimal vaccination strategy that gives the best vaccine allocation given a starting vaccination time and vaccine coverage level. We find that population structure is an important factor in determining the optimal vaccine distribution. Moreover, the optimal policy is dynamic as there is a switch in the optimal vaccination strategy at some time point just before the peak of the epidemic. For instance, with 25% vaccine coverage, it is better to protect the high-transmission groups before this point, but it is optimal to protect the most vulnerable groups afterward.

Conclusions

Choosing the optimal strategy before or early in the epidemic makes an important difference in minimizing the number of influenza infections, and consequently the number of influenza deaths or hospitalizations, but the optimal strategy makes little difference after the peak.  相似文献   

16.

Background

A network motif is a sub-network that occurs frequently in a given network. Detection of such motifs is important since they uncover functions and local properties of the given biological network. Finding motifs is however a computationally challenging task as it requires solving the costly subgraph isomorphism problem. Moreover, the topology of biological networks change over time. These changing networks are called dynamic biological networks. As the network evolves, frequency of each motif in the network also changes. Computing the frequency of a given motif from scratch in a dynamic network as the network topology evolves is infeasible, particularly for large and fast evolving networks.

Results

In this article, we design and develop a scalable method for counting the number of motifs in a dynamic biological network. Our method incrementally updates the frequency of each motif as the underlying network’s topology evolves. Our experiments demonstrate that our method can update the frequency of each motif in orders of magnitude faster than counting the motif embeddings every time the network changes. If the network evolves more frequently, the margin with which our method outperforms the existing static methods, increases.

Conclusions

We evaluated our method extensively using synthetic and real datasets, and show that our method is highly accurate(≥?96%) and that it can be scaled to large dense networks. The results on real data demonstrate the utility of our method in revealing interesting insights on the evolution of biological processes.
  相似文献   

17.

Background

Little is known about the changes of brain structural and functional connectivity networks underlying the pathophysiology in migraine. We aimed to investigate how the cortical network reorganization is altered by frequent cortical overstimulation associated with migraine.

Methodology/Principal Findings

Gray matter volumes and resting-state functional magnetic resonance imaging signal correlations were employed to construct structural and functional networks between brain regions in 43 female patients with migraine (PM) and 43 gender-matched healthy controls (HC) by using graph theory-based approaches. Compared with the HC group, the patients showed abnormal global topology in both structural and functional networks, characterized by higher mean clustering coefficients without significant change in the shortest absolute path length, which indicated that the PM lost optimal topological organization in their cortical networks. Brain hubs related to pain-processing revealed abnormal nodal centrality in both structural and functional networks, including the precentral gyrus, orbital part of the inferior frontal gyrus, parahippocampal gyrus, anterior cingulate gyrus, thalamus, temporal pole of the middle temporal gyrus and the inferior parietal gyrus. Negative correlations were found between migraine duration and regions with abnormal centrality. Furthermore, the dysfunctional connections in patients'' cortical networks formed into a connected component and three dysregulated modules were identified involving pain-related information processing and motion-processing visual networks.

Conclusions

Our results may reflect brain alteration dynamics resulting from migraine and suggest that long-term and high-frequency headache attacks may cause both structural and functional connectivity network reorganization. The disrupted information exchange between brain areas in migraine may be reshaped into a hierarchical modular structure progressively.  相似文献   

18.

Background

The traveling salesperson problem (TSP) refers to a task in which one finds the shortest path when traveling through multiple spatially distributed points. Little is known about the developmental course of the strategies used to solve TSPs. The present study examined young children''s performance and route selection strategies in one-way TSPs using a city-block metric. A touch screen-based navigation task was applied.

Methodology/Principal Findings

Children (39–70 months) and adults (21–35 years) made serial responses on a touch screen to move a picture of a dog (the target) to two or three identical pictures of a bone (the goals). For all the versions of the tasks, significant improvement in measures of performance was observed from younger to older participants. In TSPs in which a specific route selection strategy such as the nearest-neighbor strategy minimized the total traveling distance, older participants used that strategy more frequently than younger ones. By contrast, in TSPs in which multiple strategies equally led to the minimal traveling distance, children tended to use strategies different from those used by adults, such as traveling straight to the farthest goal first.

Conclusions/Significance

The results primarily suggest development of efficient route selection strategies that can optimize total numbers of movements and/or solution time. Unlike adults, children sometimes prioritized other strategies such as traveling straight ahead until being forced to change directions. This may reflect the fact that children were either less attentive to the task or less efficient at perceiving the overall shape of the problem and/or the relative distance from the starting location to each goal.  相似文献   

19.
20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号