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

Stuart Aitken

dblp:39/8277 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2015
0000-0003-4867-4568ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 5 · 3 first-author

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
2 papers
Bioinformatics and computational biology · 80% Computational science and engineering · 20%

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

TopicWeightPapersLastEvidence papers
Computational science and engineering
model selection
0.212015
Dizzy-Beats: a Bayesian evidence analysis tool for systems biology · Bioinform. 2015
Bioinformatics and computational biology › systems biology
parameter estimation
0.212015
Dizzy-Beats: a Bayesian evidence analysis tool for systems biology · Bioinform. 2015
Bioinformatics and computational biology
systems biology
0.212015
Dizzy-Beats: a Bayesian evidence analysis tool for systems biology · Bioinform. 2015
Bioinformatics and computational biology › sequence analysis
motif discovery
0.212014
Stochastic EM-based TFBS motif discovery with MITSU · Bioinform. 2014
Bioinformatics and computational biology › gene regulation
transcription factor binding site prediction
0.212014
Stochastic EM-based TFBS motif discovery with MITSU · Bioinform. 2014
Bioinformatics and computational biology › gene regulation
regulatory sequence analysis
0.112014
Stochastic EM-based TFBS motif discovery with MITSU · Bioinform. 2014

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

nested sampling · 0.2l1-norm likelihood · 0.2bayesian inference · 0.2stochastic expectation-maximization · 0.2likelihood approximation · 0.2
YearPublicationVenuePosition
2015 Dizzy-Beats: a Bayesian evidence analysis tool for systems biology
abstract
MOTIVATION: Model selection and parameter inference are complex problems of long-standing interest in systems biology. Selecting between competing models arises commonly as underlying biochemical mechanisms are often not fully known, hence alternative models must be considered. Parameter inference yields important information on the extent to which the data and the model constrain parameter values. RESULTS: We report Dizzy-Beats, a graphical Java Bayesian evidence analysis tool implementing nested sampling - an algorithm yielding an estimate of the log of the Bayesian evidence Z and the moments of model parameters, thus addressing two outstanding challenges in systems modelling. A likelihood function based on the L1-norm is adopted as it is generically applicable to replicated time series data. AVAILABILITY AND IMPLEMENTATION: http://sourceforge.net/p/bayesevidence/home/Home/.
Stuart Aitken, Alastair M. Kilpatrick, Ozgur E. Akman
Bioinform.1
2015 Transcriptional Dynamics Reveal Critical Roles for Non-coding RNAs in the Immediate-Early Response
abstract
The immediate-early response mediates cell fate in response to a variety of extracellular stimuli and is dysregulated in many cancers. However, the specificity of the response across stimuli and cell types, and the roles of non-coding RNAs are not well understood. Using a large collection of densely-sampled time series expression data we have examined the induction of the immediate-early response in unparalleled detail, across cell types and stimuli. We exploit cap analysis of gene expression (CAGE) time series datasets to directly measure promoter activities over time. Using a novel analysis method for time series data we identify transcripts with expression patterns that closely resemble the dynamics of known immediate-early genes (IEGs) and this enables a comprehensive comparative study of these genes and their chromatin state. Surprisingly, these data suggest that the earliest transcriptional responses often involve promoters generating non-coding RNAs, many of which are produced in advance of canonical protein-coding IEGs. IEGs are known to be capable of induction without de novo protein synthesis. Consistent with this, we find that the response of both protein-coding and non-coding RNA IEGs can be explained by their transcriptionally poised, permissive chromatin state prior to stimulation. We also explore the function of non-coding RNAs in the attenuation of the immediate early response in a small RNA sequencing dataset matched to the CAGE data: We identify a novel set of microRNAs responsible for the attenuation of the IEG response in an estrogen receptor positive cancer cell line. Our computational statistical method is well suited to meta-analyses as there is no requirement for transcripts to pass thresholds for significant differential expression between time points, and it is agnostic to the number of time points per dataset.
Stuart Aitken, Shigeyuki Magi, Ahmad M. N. Alhendi, Masayoshi Itoh, Hideya Kawaji, Timo Lassmann, Carsten O. Daub, Erik Arner, Piero Carninci, Alistair R. R. Forrest, Yoshihide Hayashizaki, Levon M. Khachigian, Mariko Okada, C. A. M. Semple
PLoS Comput. Biol.1
2014 Stochastic EM-based TFBS motif discovery with MITSU
abstract
MOTIVATION: The Expectation-Maximization (EM) algorithm has been successfully applied to the problem of transcription factor binding site (TFBS) motif discovery and underlies the most widely used motif discovery algorithms. In the wider field of probabilistic modelling, the stochastic EM (sEM) algorithm has been used to overcome some of the limitations of the EM algorithm; however, the application of sEM to motif discovery has not been fully explored. RESULTS: We present MITSU (Motif discovery by ITerative Sampling and Updating), a novel algorithm for motif discovery, which combines sEM with an improved approximation to the likelihood function, which is unconstrained with regard to the distribution of motif occurrences within the input dataset. The algorithm is evaluated quantitatively on realistic synthetic data and several collections of characterized prokaryotic TFBS motifs and shown to outperform EM and an alternative sEM-based algorithm, particularly in terms of site-level positive predictive value. AVAILABILITY AND IMPLEMENTATION: Java executable available for download at http://www.sourceforge.net/p/mitsu-motif/, supported on Linux/OS X.
Alastair M. Kilpatrick, Bruce Ward, Stuart Aitken
Bioinform.3
2012 EnzML: multi-label prediction of enzyme classes using InterPro signatures
abstract
BACKGROUND: Manual annotation of enzymatic functions cannot keep up with automatic genome sequencing. In this work we explore the capacity of InterPro sequence signatures to automatically predict enzymatic function. RESULTS: We present EnzML, a multi-label classification method that can efficiently account also for proteins with multiple enzymatic functions: 50,000 in UniProt. EnzML was evaluated using a standard set of 300,747 proteins for which the manually curated Swiss-Prot and KEGG databases have agreeing Enzyme Commission (EC) annotations. EnzML achieved more than 98% subset accuracy (exact match of all correct Enzyme Commission classes of a protein) for the entire dataset and between 87 and 97% subset accuracy in reannotating eight entire proteomes: human, mouse, rat, mouse-ear cress, fruit fly, the S. pombe yeast, the E. coli bacterium and the M. jannaschii archaebacterium. To understand the role played by the dataset size, we compared the cross-evaluation results of smaller datasets, either constructed at random or from specific taxonomic domains such as archaea, bacteria, fungi, invertebrates, plants and vertebrates. The results were confirmed even when the redundancy in the dataset was reduced using UniRef100, UniRef90 or UniRef50 clusters. CONCLUSIONS: InterPro signatures are a compact and powerful attribute space for the prediction of enzymatic function. This representation makes multi-label machine learning feasible in reasonable time (30 minutes to train on 300,747 instances with 10,852 attributes and 2,201 class values) using the Mulan Binary Relevance Nearest Neighbours algorithm implementation (BR-kNN).
Luna De Ferrari, Stuart Aitken, Jano I. van Hemert, Igor Goryanin
BMC Bioinform.2
2011 Modelling Reveals Kinetic Advantages of Co-Transcriptional Splicing
abstract
Messenger RNA splicing is an essential and complex process for the removal of intron sequences. Whereas the composition of the splicing machinery is mostly known, the kinetics of splicing, the catalytic activity of splicing factors and the interdependency of transcription, splicing and mRNA 3' end formation are less well understood. We propose a stochastic model of splicing kinetics that explains data obtained from high-resolution kinetic analyses of transcription, splicing and 3' end formation during induction of an intron-containing reporter gene in budding yeast. Modelling reveals co-transcriptional splicing to be the most probable and most efficient splicing pathway for the reporter transcripts, due in part to a positive feedback mechanism for co-transcriptional second step splicing. Model comparison is used to assess the alternative representations of reactions. Modelling also indicates the functional coupling of transcription and splicing, because both the rate of initiation of transcription and the probability that step one of splicing occurs co-transcriptionally are reduced, when the second step of splicing is abolished in a mutant reporter.
Stuart Aitken, Ross D. Alexander, Jean D. Beggs
PLoS Comput. Biol.1