Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Pat Heslop-Harrison

dblp:40/5528 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2011
0000-0002-3105-2167ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 5

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
3 papers
Bioinformatics and computational biology · 83% Computational social science and digital humanities · 17%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › network bioinformatics › biological network analysis › network topology analysis
network motif discovery
0.112011
Evolutionary design principles and functional characteristics based on kingdom-specific network motifs · Bioinform. 2011
Bioinformatics and computational biology
systems biology
0.112011
Evolutionary design principles and functional characteristics based on kingdom-specific network motifs · Bioinform. 2011
Bioinformatics and computational biology › gene regulation
gene regulatory network
0.112008
Evolutionary design principles of modules that control cellular differentiation: consequences for hysteresis and multistationarity · Bioinform. 2008
Bioinformatics and computational biology › biological network › network biology › network inference
gene regulatory network inference
0.112008
Linear time-varying models can reveal non-linear interactions of biomolecular regulatory networks using multiple time-series data · Bioinform. 2008
Computational social science and digital humanities › network science
network evolution
0.112008
Evolutionary design principles of modules that control cellular differentiation: consequences for hysteresis and multistationarity · Bioinform. 2008

Methods — techniques the papers use, named apart from their topics

network motif detection · 0.1random perturbation · 0.1phase portrait analysis · 0.1nonlinear optimization · 0.1network topology analysis · 0.1evolutionary simulation · 0.1
YearPublicationVenuePosition
2011 Evolutionary design principles and functional characteristics based on kingdom-specific network motifs
abstract
BACKGROUND: Network motifs within biological networks show non-random abundances in systems at different scales. Large directed protein networks at the cellular level are now well defined in several diverse species. We aimed to compare the nature of significantly observed two- and three-node network motifs across three different kingdoms (Arabidopsis thaliana for multicellular plants, Saccharomyces cerevisiae for unicellular fungi and Homo sapiens for animals). RESULTS: 'Two-node feedback' is the most significant motif in all three species. By considering the sign of each two-node feedback interaction, we examined the enrichment of the three types of two-node feedbacks [positive-positive (PP), negative-negative (NN) and positive-negative (PN)]. We found that PN is enriched in the network of A.thaliana, NN in the network of S.cerevisiae and PP and NN in the network of H.sapiens. Each feedback type has characteristic features of robustness, multistability and homeostasis. CONCLUSIONS: We suggest that amplification of particular network motifs emerges from contrasting dynamical and topological properties of the motifs, reflects the evolutionary design principles selected by the characteristic behavior of each species and provides a signature pointing to their behavior and function.
Junil Kim, Pat Heslop-Harrison, Kwang-Hyun Cho
Bioinform.3
2008 Linear time-varying models can reveal non-linear interactions of biomolecular regulatory networks using multiple time-series data
abstract
MOTIVATION: Inherent non-linearities in biomolecular interactions make the identification of network interactions difficult. One of the principal problems is that all methods based on the use of linear time-invariant models will have fundamental limitations in their capability to infer certain non-linear network interactions. Another difficulty is the multiplicity of possible solutions, since, for a given dataset, there may be many different possible networks which generate the same time-series expression profiles. RESULTS: A novel algorithm for the inference of biomolecular interaction networks from temporal expression data is presented. Linear time-varying models, which can represent a much wider class of time-series data than linear time-invariant models, are employed in the algorithm. From time-series expression profiles, the model parameters are identified by solving a non-linear optimization problem. In order to systematically reduce the set of possible solutions for the optimization problem, a filtering process is performed using a phase-portrait analysis with random numerical perturbations. The proposed approach has the advantages of not requiring the system to be in a stable steady state, of using time-series profiles which have been generated by a single experiment, and of allowing non-linear network interactions to be identified. The ability of the proposed algorithm to correctly infer network interactions is illustrated by its application to three examples: a non-linear model for cAMP oscillations in Dictyostelium discoideum, the cell-cycle data for Saccharomyces cerevisiae and a large-scale non-linear model of a group of synchronized Dictyostelium cells. AVAILABILITY: The software used in this article is available from http://sbie.kaist.ac.kr/software
Jongrae Kim, Declan G. Bates, Ian Postlethwaite, Pat Heslop-Harrison, Kwang-Hyun Cho
Bioinform.4
2008 Evolutionary design principles of modules that control cellular differentiation: consequences for hysteresis and multistationarity
abstract
MOTIVATION: Gene regulatory networks (GRNs) govern cellular differentiation processes and enable construction of multicellular organisms from single cells. Although such networks are complex, there must be evolutionary design principles that shape the network to its present form, gaining complexity from simple modules. RESULTS: To isolate particular design principles, we have computationally evolved random regulatory networks with a preference to result either in hysteresis (switching threshold depending on current state), or in multistationarity (having multiple steady states), two commonly observed dynamical features of GRNs related to differentiation processes. We have analyzed the resulting evolved networks and compared their structures and characteristics with real GRNs reported from experiments. CONCLUSION: We found that the artificially evolved networks have particular topologies and it was notable that these topologies share important features and similarities with the real GRNs, particularly in contrasting properties of positive and negative feedback loops. We conclude that the structures of real GRNs are consistent with selection to favor one or other of the dynamical features of multistationarity or hysteresis. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Junil Kim, Tae-Geon Kim, Sung Hoon Jung, Jeong-Rae Kim, Taesung Park, Pat Heslop-Harrison, Kwang-Hyun Cho
Bioinform.6
2007 Least-squares methods for identifying biochemical regulatory networks from noisy measurements
abstract
BACKGROUND: We consider the problem of identifying the dynamic interactions in biochemical networks from noisy experimental data. Typically, approaches for solving this problem make use of an estimation algorithm such as the well-known linear Least-Squares (LS) estimation technique. We demonstrate that when time-series measurements are corrupted by white noise and/or drift noise, more accurate and reliable identification of network interactions can be achieved by employing an estimation algorithm known as Constrained Total Least Squares (CTLS). The Total Least Squares (TLS) technique is a generalised least squares method to solve an overdetermined set of equations whose coefficients are noisy. The CTLS is a natural extension of TLS to the case where the noise components of the coefficients are correlated, as is usually the case with time-series measurements of concentrations and expression profiles in gene networks. RESULTS: The superior performance of the CTLS method in identifying network interactions is demonstrated on three examples: a genetic network containing four genes, a network describing p53 activity and mdm2 messenger RNA interactions, and a recently proposed kinetic model for interleukin (IL)-6 and (IL)-12b messenger RNA expression as a function of ATF3 and NF-kappaB promoter binding. For the first example, the CTLS significantly reduces the errors in the estimation of the Jacobian for the gene network. For the second, the CTLS reduces the errors from the measurements that are corrupted by white noise and the effect of neglected kinetics. For the third, it allows the correct identification, from noisy data, of the negative regulation of (IL)-6 and (IL)-12b by ATF3. CONCLUSION: The significant improvements in performance demonstrated by the CTLS method under the wide range of conditions tested here, including different levels and types of measurement noise and different numbers of data points, suggests that its application will enable more accurate and reliable identification and modelling of biochemical networks.
Jongrae Kim, Declan G. Bates, Ian Postlethwaite, Pat Heslop-Harrison, Kwang-Hyun Cho
BMC Bioinform.4
2007 Stochastic Noise and Synchronisation during Dictyostelium Aggregation Make cAMP Oscillations Robust
abstract
Stable and robust oscillations in the concentration of adenosine 3', 5'-cyclic monophosphate (cAMP) are observed during the aggregation phase of starvation-induced development in Dictyostelium discoideum. In this paper we use mathematical modelling together with ideas from robust control theory to identify two factors which appear to make crucial contributions to ensuring the robustness of these oscillations. Firstly, we show that stochastic fluctuations in the molecular interactions play an important role in preserving stable oscillations in the face of variations in the kinetics of the intracellular network. Secondly, we show that synchronisation of the aggregating cells through the diffusion of extracellular cAMP is a key factor in ensuring robustness of the oscillatory waves of cAMP observed in Dictyostelium cell cultures to cell-to-cell variations. A striking and quite general implication of the results is that the robustness analysis of models of oscillating biomolecular networks (circadian clocks, Ca(2+) oscillations, etc.) can only be done reliably by using stochastic simulations, even in the case where molecular concentrations are very high.
Jongrae Kim, Pat Heslop-Harrison, Ian Postlethwaite, Declan G. Bates
PLoS Comput. Biol.2