Search bioRxiv⌕ Search

Biology subjects

Clare, A.

Publications and source records attributed to Clare, A..

7 recordsLinked to original sources

FrameRate: learning the coding potential of unassembled metagenomic reads

MotivationMetagenomic assembly is a slow and computationally intensive process and despite needing iterative rounds for improvement and completeness the resulting assembly often fails to incorporate many of the input sequencing reads. This is further complicated when there is reduced read-depth and/or artefacts which result in chimeric assemblies both of which are especially prominent in the assembly of metagenomic datasets. Many of these limitations could potentially be overcome by exploiting the information content stored in the reads directly and thus eliminating the need for assembly in a number of situations. ResultsWe explored the prediction of coding potential of DNA reads by training a machine learning model on existing protein sequences. Named FrameRate, this model can predict the coding frame(s) from unassembled DNA sequencing reads directly, thus greatly reducing the computational resources required for genome assembly and similarity-based inference to pre-computed databases. Using the eggNOG-mapper function annotation tool, the predicted coding frames from FrameRate were functionally verified by comparing to the results from full-length protein sequences reconstructed with an established metagenome assembly and gene prediction pipeline from the same metagenomic sample. FrameRate captured equivalent functional profiles from the coding frames while reducing the required storage and time resources significantly. FrameRate was also able to annotate reads that were not represented in the assembly, capturing this missing information. As an ultra-fast read-level assembly-free coding profiler, FrameRate enables rapid characterisation of almost every sequencing read directly, whether it can be assembled or not, and thus circumvent many of the problems caused by contemporary assembly workflows. Availabilityhttps://github.com/NickJD/FrameRate Contactliuwei.wang@fu-berlin.de and nicholas@dimonaco.co.uk

bioinformatics↗

StORF-Reporter: Finding Genes between Genes

Large regions of prokaryotic genomes are currently without any annotation, in part due to well-established limitations of annotation tools. For example, it is routine for annotation tools to misreport or completely omit genes using alternative start codons. Therefore, we present StORF-Reporter, a tool that takes an annotated genome and returns missing CDS genes from unannotated regions. StORF-Reporter consists of two parts. The first begins with the extraction of unannotated regions from an annotated genome. Next, Stop-ORFs (StORFs) are identified in these unannotated regions. StORFs are open reading frames that are delimited by stop codons and thus can capture those genes most often missing in genome annotations. We show that this methodology recovers genes missing from canonical genome annotations. We inspected the results of the genomes of model organisms, the pangenome of Escherichia coli, and a further 6,223 prokaryotic genomes of 179 genera from the Ensembl Bacteria database. StORF-Reporter was able to extend the core, soft-core and accessory gene-collections, identify novel gene families and extend families into additional genera. The high levels of sequence conservation observed between genera suggest that many of these StORF sequences are likely to be functional genes that must now be added to the canonical annotations.

bioinformatics↗

No one tool to rule them all: Prokaryotic gene prediction tool performance is highly dependent on the organism of study

MotivationThe biases in Open Reading Frame (ORF) 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 ORF prediction tool and allow them to choose the right tool for their analysis. ResultsWe 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 ORF 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. Availabilityhttps://github.com/NickJD/ORForise Contactnicholas@dimonaco.co.uk Supplementary informationSupplementary data are available at bioRxiv online.

bioinformatics↗

On the complexity of haplotyping a microbial community

MotivationPopulation-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. ResultsThe problem of single individual haplotyping (SIH) was first formalised by Lancia et al in 2001. Now, nearly two decades later, we discuss the complexity of "haplotyping" metagenomic samples, with a new formalisation 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 (MIH) problem. We also provide software implementations of our proposed pairwise single nucleotide variant (SNV) co-occurrence matrix and greedy graph traversal algorithm. Availability and implementationOur reference implementation of the described pairwise SNV matrix (Hansel) and greedy haplotype path traversal algorithm (Gretel) are open source, MIT licensed and freely available online at github.com/samstudio8/hansel and github.com/samstudio8/gretel, respectively. Contact s.nicholls.1@bham.ac.uk

bioinformatics↗

GiraFFe Browse: A lightweight web based tool for inspecting GFF and FASTA data

SummaryGiraFFe Browse is a tool aimed at making GFF and FASTA data more useful and accessible to researchers. Existing solutions are large in scope and difficult to maintain without specialist knowledge of computer systems. GiraFFe Browse is a lightweight alternative, built using modern software engineering practices with a focus on being developer and user friendly.\n\nAvailability and implementationGiraFFe Browse is open source (GPL) software that is available from the Github repository: https://github.com/bag-man/giraffe-browse\n\nDemo versionAn example installation of the application is available at http://giraffe.owen.cymru, using a GFF and FASTA file of Escherichia coli from the European Nucleotide Archive.\n\nContactgarland.owen@gmail.com

bioinformatics↗

Computational haplotype recovery and long-read validation identifies novel isoforms of industrially relevant enzymes from natural microbial communities

Elucidation of population-level diversity of microbiomes is a significant step towards a complete understanding of the evolutionary, ecological and functional importance of microbial communities. Characterizing this diversity requires the recovery of the exact DNA sequence (haplotype) of each gene isoform from every individual present in the community. To address this, we present Hansel and Gretel: a freely-available data structure and algorithm, providing a software package that reconstructs the most likely haplotypes from metagenomes. We demonstrate recovery of haplotypes from short-read Illumina data for a bovine rumen microbiome, and verify our predictions are 100% accurate with long-read PacBio CCS sequencing. We show that Gretels haplotypes can be analyzed to determine a significant difference in mutation rates between core and accessory gene families in an ovine rumen microbiome. All tools, documentation and data for evaluation are open source and available via our repository: https://github.com/samstudio8/gretel

bioinformatics↗

Probabilistic Recovery Of Cryptic Haplotypes From Metagenomic Data

The cryptic diversity of microbial communities represent an untapped biotechnological resource for biomining, biorefining and synthetic biology. Revealing this information requires the recovery of the exact sequence of DNA bases (or \"haplotype\") that constitutes the genes and genomes of every individual present. This is a computationally difficult problem complicated by the requirement for environmental sequencing approaches (metagenomics) due to the resistance of the constituent organisms to culturing in vitro.\n\nHaplotypes are identified by their unique combination of DNA variants. However, standard approaches for working with metagenomic data require simplifications that violate assumptions in the process of identifying such variation. Furthermore, current haplotyping methods lack objective mechanisms for choosing between alternative haplotype reconstructions from microbial communities.\n\nTo address this, we have developed a novel probabilistic approach for reconstructing haplotypes from complex microbial communities and propose the \"metahaplome\" as a definition for the set of haplotypes for any particular genomic region of interest within a metagenomic dataset. Implemented in the twin software tools Hansel and Gretel, the algorithm performs incremental probabilistic haplotype recovery using Naive Bayes -- an efficient and effective technique.\n\nOur approach is capable of reconstructing the haplotypes with the highest likelihoods from metagenomic datasets without a priori knowledge or making assumptions of the distribution or number of variants. Additionally, the algorithm is robust to sequencing and alignment error without altering or discarding observed variation and uses all available evidence from aligned reads. We validate our approach using synthetic metahaplomes constructed from sets of real genes, and demonstrate its capability using metagenomic data from a complex HIV-1 strain mix. The results show that the likelihood framework can allow recovery from microbial communities of cryptic functional isoforms of genes with 100% accuracy.

bioinformatics↗