Biology subjects

Schrinner, S.

Publications and source records attributed to Schrinner, S..

3 recordsLinked to original sources

bioRxiv2022

Haplotype-resolved assembly of a tetraploid potato genome using long reads and low-depth offspring data

Potato is one of the worlds major staple crops and like many important crop plants it has a polyploid genome. Polyploid haplotype assembly poses a major computational challenge, hindering the use of genomic data in breeding strategies. Here, we introduce a novel strategy for the assembly of polyploid genomes and present an assembly of the autotetraploid potato cultivar Altus. Our method uses low-depth sequencing data from an offspring population, which is available in many plant breeding settings, to achieve chromosomal clustering and haplotype phasing directly on the assembly graph. This involves a novel strategy for the analysis of k-mers unique to specific graph nodes. Our approach generates assemblies of individual chromosomes with phased haplotig N50 values of up to 13 Mb and haplotig lengths of up to 31 Mb. This major advance provides high-quality assemblies with haplotype-specific sequence resolution of whole chromosome arms and can be applied in common breeding scenarios where collections of offspring are available.

genomics↗

bioRxiv2020

The Homo-Edit Distance Problem

We consider the homo-edit distance problem, which is the minimum number of homo-deletions or homo-insertions to convert one string into another. A homo-insertion is the insertion of a string of equal characters into another string, while a homo-deletion is the inverse operation. We show how to compute the homo-edit distance of two strings in polynomial time: We first demonstrate that the problem is equivalent to computing a common subsequence of the two input strings with a minimum number of homo-deletions and then present a dynamic programming solution for the reformulated problem. 2012 ACM Subject ClassificationApplied computing [->] Bioinformatics; Applied computing [->] Molecular sequence analysis; Theory of computation [->] Dynamic programming

bioinformatics↗

bioRxiv2020

Haplotype Threading: Accurate Polyploid Phasing from Long Reads

Resolving genomes at haplotype level is crucial for understanding the evolutionary history of polyploid species and for designing advanced breeding strategies. As a highly complex computational problem, polyploid phasing still presents considerable challenges, especially in regions of collapsing haplotypes. We present WO_SCPLOWHATSC_SCPLOWHO_SCPLOWAPC_SCPLOWO_SCPCAP C_SCPCAPO_SCPLOWPOLYPHASEC_SCPLOW, a novel two-stage approach that addresses these challenges by (i) clustering reads using a position-dependent scoring function and (ii) threading the haplotypes through the clusters by dynamic programming. We demonstrate on a simulated data set that this results in accurate haplotypes with switch error rates that are around three times lower than those obtainable by the current state-of-the-art and even around seven times lower in regions of collapsing haplotypes. Using a real data set comprising long and short read tetraploid potato sequencing data we show that WO_SCPLOWHATSC_SCPLOWHO_SCPLOWAPC_SCPLOWO_SCPCAP C_SCPCAPO_SCPLOWPOLYPHASEC_SCPLOW is able to phase the majority of the potato genes after error correction, which enables the assembly of local genomic regions of interest at haplotype level. Our algorithm is implemented as part of the widely used open source tool WhatsHap and ready to be included in production settings.

bioinformatics↗