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

David A. Hodgson

dblp:99/7795 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none

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

Artificial intelligence and machine learning · 3Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

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
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › biological network › network biology › network inference
causal network inference
0.212014
Correcting for link loss in causal network inference caused by regulator interference · Bioinform. 2014
Bioinformatics and computational biology › biological network › network biology › network inference
gene regulatory network inference
0.212014
Correcting for link loss in causal network inference caused by regulator interference · Bioinform. 2014

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

conditional link probability analysis · 0.2
YearPublicationVenuePosition
2014 Correcting for link loss in causal network inference caused by regulator interference
abstract
MOTIVATION: There are a number of algorithms to infer causal regulatory networks from time series (gene expression) data. Here we analyse the phenomena of regulator interference, where regulators with similar dynamics mutually suppress both the probability of regulating a target and the associated link strength; for instance, interference between two identical strong regulators reduces link probabilities by ∼50%. RESULTS: We construct a robust method to define an interference-corrected causal network based on an analysis of the conditional link probabilities that recovers links lost through interference. On a large real network (Streptomyces coelicolor, phosphate depletion), we demonstrate that significant interference can occur between regulators with a correlation as low as 0.865, losing an estimated 34% of links by interference. However, levels of interference cannot be predicted from the correlation between regulators alone and are data specific. Validating against known networks, we show that high numbers of functional links are lost by regulator interference. Performance against other methods on DREAM4 data is excellent. AVAILABILITY AND IMPLEMENTATION: The method is implemented in R and is publicly available as the NIACS package at http://www2.warwick.ac.uk/fac/sci/systemsbiology/research/software.
Christopher A. Penfold, David A. Hodgson, Miriam L. Gifford, Nigel J. Burroughs
Bioinform.3
2005 Preface
Martyn Amos, David A. Hodgson
Nat. Comput.2
2001 DNA-based logic
Gerald G. Owenson, Martyn Amos, David A. Hodgson, Alan Gibbons
Soft Comput.3
1999 Molecular implementation of computational components
abstract
Complex natural processes may often be expressed in terms of networks of computational components, such as Boolean logic gates or artificial neurons. The interaction of biological molecules and the flow of information controlling the development and behaviour of organisms is particularly amenable to this approach, and these models are well established in the biological community. However, only relatively recently have papers appeared proposing the use of such systems to perform useful, human-defined tasks. Rather than merely using the network analogy as a convenient technique for clarifying our understanding of complex systems, it may now be possible to harness the power of such systems for the purposes of computation. We review several such proposals, focusing on the molecular implementation of fundamental computational elements.
Gerald G. Owenson, Martyn Amos, David A. Hodgson, Alan Gibbons
CEC3
1996 Models of DNA Computation
Alan Gibbons, Martyn Amos, David A. Hodgson
MFCS3