Article

Validating Paired-end Read Alignments in Sequence Graphs

2019-06-26

Abstract excerpt

Graph based non-linear reference structures such as variation graphs and colored de Bruijn graphs enable incorporation of full genomic diversity within a population. However, transitioning from a simple string-based reference to graphs requires addressing many computational challenges, one of which concerns accurately mapping sequencing read sets to graphs. Paired-end Illumina sequencing is a commonly used sequenc...

Topics

Open a Topic to create a Post that cites this publication.

Identifiers and source

Literature Corpus work: f7b3a596-21e8-5974-86e3-e474e90d4dce
DOI: 10.1101/682799

Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 12 closest

Validating Paired-end Read Alignments in Sequence GraphsDOI 10.1101/682799Read

DiVerG: Scalable Distance Index for Validation of Paired-End Alignments in Sequence GraphsSemantic proximity Read

Accelerating Sequence Alignment to GraphsSemantic proximity Read

Haplotype-aware sequence alignment to pangenome graphsSemantic proximity Read

GraphSlimmer: Preserving Read Mappability with the Minimum Number of Variants.Semantic proximity Read

Lossless Indexing with Counting de Bruijn GraphsSemantic proximity Read

Genome GraphsSemantic proximity Read

Sequence variation aware genome references and read mapping with the variation graph toolkitSemantic proximity Read

Fast read alignment with incorporation of known genomic variants.Semantic proximity Read

A variant selection framework for genome graphsSemantic proximity Read

A variant selection framework for genome graphs.Semantic proximity Read

Minimizer-space de Bruijn graphsSemantic proximity Read

Indel-tolerant read mapping with trinucleotide frequencies using cache-oblivious kd-trees.Semantic proximity Read