Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

Using 2k + 2 bubble searches to find single nucleotide polymorphisms in k-mer graphs.

Bioinformatics (Oxford, England) - 1 Mar 2015

Younsi Reda, MacLean Dan

Abstract excerpt

MOTIVATION: Single nucleotide polymorphism (SNP) discovery is an important preliminary for understanding genetic variation. With current sequencing methods, we can sample genomes comprehensively. SNPs are found by aligning sequence reads against longer assembled references. De Bruijn graphs are e...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Algorithms
Share to Genome, Human
Share to Genomics

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Polymorphism, Single Nucleotide

Share to Sequence Analysis, DNA

Source

Open in PubMed Open full text

Identifiers

PMID: 25344498
DOI: 10.1093/bioinformatics/btu706
PMCID: PMC4341063

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 4 Sept 2026. Prepared record publication-25344498-2026-09-04.2. Manifest publication-graph-cohort-2026-09-04.2.

Source receipt: PubMed via Helena Literature Corpus, retrieved 4 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Using 2k + 2 bubble searches to find single nucleotide polymorphisms in k-mer graphs.PMID 25344498Read ↗

BubbleGun: Enumerating Bubbles and Superbubbles in Genome GraphsSemantic proximity Read ↗

Identifying and classifying trait linked polymorphisms in non-reference species by walking coloured de bruijn graphs.Semantic proximity Read ↗

Scalable computation of ultrabubbles in pangenomes by orienting bidirected graphsSemantic proximity Read ↗

Investigating the topological motifs of inversions in pangenome graphsSemantic proximity Read ↗

A comprehensive benchmark of graph-based genetic variant genotyping algorithms on plant genomes for creating an accurate ensemble pipelineSemantic proximity Read ↗

A comprehensive benchmark of graph-based genetic variant genotyping algorithms on plant genomes for creating an accurate ensemble pipeline.Semantic proximity Read ↗

Billi: Provably Accurate and Scalable Bubble Detection in Pangenome GraphsSemantic proximity Read ↗

Single Nucleotide Polymorphism Identification in Polyploids: A Review, Example, and Recommendations.Semantic proximity Read ↗

A k-mer-based genome-wide association study approach empowering gene mining in polyploids.Semantic proximity Read ↗

GCphase: an SNP phasing method using a graph partition and error correction algorithm.Semantic proximity Read ↗

Minimizer-space de Bruijn graphsSemantic proximity Read ↗

Metagenome SNP calling via read-colored de Bruijn graphs.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.