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

Wayne Aubrey

dblp:46/4453 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2022
0000-0003-3351-1758ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 3 · 2 since 2021

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 · 100%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › genome annotation
gene prediction
0.612022
No one tool to rule them all: prokaryotic gene prediction tool annotations are highly dependent on the organism of study · Bioinform. 2022
Bioinformatics and computational biology
genomics
0.612022
No one tool to rule them all: prokaryotic gene prediction tool annotations are highly dependent on the organism of study · Bioinform. 2022
Bioinformatics and computational biology › genome annotation › gene prediction
prokaryotic gene prediction
0.612022
No one tool to rule them all: prokaryotic gene prediction tool annotations are highly dependent on the organism of study · Bioinform. 2022
Bioinformatics and computational biology › genomics
computational genomics
0.512021
On the complexity of haplotyping a microbial community · Bioinform. 2021
Bioinformatics and computational biology
metagenomics
0.512021
On the complexity of haplotyping a microbial community · Bioinform. 2021
Knowledge, reasoning and agents › Knowledge representation and reasoning
ontology
0.012008
The EXACT description of biomedical protocols · ISMB 2008

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

performance metrics · 0.6benchmarking · 0.6pairwise SNV co-occurrence matrix · 0.5greedy graph traversal · 0.5ontology engineering · 0.2
YearPublicationVenuePosition
2022 No one tool to rule them all: prokaryotic gene prediction tool annotations are highly dependent on the organism of study
abstract
MOTIVATION: The biases in CoDing Sequence (CDS) prediction tools, which have been based on historic genomic annotations from model organisms, impact our understanding of novel genomes and metagenomes. This hinders the discovery of new genomic information as it results in predictions being biased towards existing knowledge. To date, users have lacked a systematic and replicable approach to identify the strengths and weaknesses of any CDS prediction tool and allow them to choose the right tool for their analysis. RESULTS: We present an evaluation framework (ORForise) based on a comprehensive set of 12 primary and 60 secondary metrics that facilitate the assessment of the performance of CDS prediction tools. This makes it possible to identify which performs better for specific use-cases. We use this to assess 15 ab initio- and model-based tools representing those most widely used (historically and currently) to generate the knowledge in genomic databases. We find that the performance of any tool is dependent on the genome being analysed, and no individual tool ranked as the most accurate across all genomes or metrics analysed. Even the top-ranked tools produced conflicting gene collections, which could not be resolved by aggregation. The ORForise evaluation framework provides users with a replicable, data-led approach to make informed tool choices for novel genome annotations and for refining historical annotations. AVAILABILITY AND IMPLEMENTATION: Code and datasets for reproduction and customisation are available at https://github.com/NickJD/ORForise. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Nicholas J. Dimonaco, Wayne Aubrey, Kim Kenobi, Amanda Clare, Christopher J. Creevey
Bioinform.2
2021 On the complexity of haplotyping a microbial community
abstract
MOTIVATION: Population-level genetic variation enables competitiveness and niche specialization in microbial communities. Despite the difficulty in culturing many microbes from an environment, we can still study these communities by isolating and sequencing DNA directly from an environment (metagenomics). Recovering the genomic sequences of all isoforms of a given gene across all organisms in a metagenomic sample would aid evolutionary and ecological insights into microbial ecosystems with potential benefits for medicine and biotechnology. A significant obstacle to this goal arises from the lack of a computationally tractable solution that can recover these sequences from sequenced read fragments. This poses a problem analogous to reconstructing the two sequences that make up the genome of a diploid organism (i.e. haplotypes) but for an unknown number of individuals and haplotypes. RESULTS: The problem of single individual haplotyping was first formalized by Lancia et al. in 2001. Now, nearly two decades later, we discuss the complexity of 'haplotyping' metagenomic samples, with a new formalization of Lancia et al.'s data structure that allows us to effectively extend the single individual haplotype problem to microbial communities. This work describes and formalizes the problem of recovering genes (and other genomic subsequences) from all individuals within a complex community sample, which we term the metagenomic individual haplotyping problem. We also provide software implementations for a pairwise single nucleotide variant (SNV) co-occurrence matrix and greedy graph traversal algorithm. AVAILABILITY AND IMPLEMENTATION: Our reference implementation of the described pairwise SNV matrix (Hansel) and greedy haplotype path traversal algorithm (Gretel) is open source, MIT licensed and freely available online at github.com/samstudio8/hansel and github.com/samstudio8/gretel, respectively.
Samuel M. Nicholls, Wayne Aubrey, Kurt De Grave, Leander Schietgat, Christopher J. Creevey, Amanda Clare
Bioinform.2
2008 The EXACT description of biomedical protocols
abstract
MOTIVATION: Many published manuscripts contain experiment protocols which are poorly described or deficient in information. This means that the published results are very hard or impossible to repeat. This problem is being made worse by the increasing complexity of high-throughput/automated methods. There is therefore a growing need to represent experiment protocols in an efficient and unambiguous way. RESULTS: We have developed the Experiment ACTions (EXACT) ontology as the basis of a method of representing biological laboratory protocols. We provide example protocols that have been formalized using EXACT, and demonstrate the advantages and opportunities created by using this formalization. We argue that the use of EXACT will result in the publication of protocols with increased clarity and usefulness to the scientific community. AVAILABILITY: The ontology, examples and code can be downloaded from http://www.aber.ac.uk/compsci/Research/bio/dss/EXACT/.
Larisa N. Soldatova, Wayne Aubrey, Ross D. King, Amanda Clare
ISMB2