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 (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 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) are open source, MIT licensed and freely available online at github.com/samstudio8/hansel and github.com/samstudio8/gretel, respectively.

Genome Sequencing of SARS-CoV-2 Allows Monitoring of Variants of Concern through Wastewater

“…Specifically, ranges consisted of SNPs within 130 base-pairs given the read length of 150 bp. For ranges spanning a signature mutation, haplotypes were reconstructed with Gretel v0.094 [42] for each of the sample-specific interval(s) using the alignment files and further refined retaining only the haplotypes whose variants were present in the sample-specific VCF files.…”

Generation of lineage-resolved complete metagenome-assembled genomes by precision phasing

“…Combined with prior definitions of SCG quality metrics, we further extend the term to "lineage-resolved complete MAGs" for all such assemblies which have high degrees of SCG completeness (> 90%), low degrees of SCG redundancy (< 10%), and the separation of all observable variant lineages of microbial taxa into individual MAGs. Tools have been developed to identify or separate lineage-resolved complete MAGs from metagenomic bins post-hoc, but these tools often rely on co-assembly data, assembly graphs or various statistical methods to overcome biases in read-alignments to estimate strains from observed genetic variant data and therefore require more curation to properly disentangle lineages from MAGs 11,14,15 .…”

Enhancing Long-Read-Based Strain-Aware Metagenome Assembly

“…The genomes serving as a template for both simulated data sets were retrieved from (Quince et al, 2017); note that these genomes were already used in several studies before (Nicholls et al, 2021;Luo et al, 2022).…”