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

The Statistics of Parametrized Syncmers in a Simple Mutation Process Without Spurious Matches.

Journal of computational biology : a journal of computational molecular cell biology - 1 Dec 2024

Spouge John L, Das Pijush, Chen Ye, Frith Martin

Abstract excerpt

Introduction: Often, bioinformatics uses summary sketches to analyze next-generation sequencing data, but most sketches are not well understood statistically. Under a simple mutation model, Blanca et al. analyzed complete sketches, that is, the complete set of unassembled k-mers, from two closely related sequences. The analysis extracted a point mutation parameter θ quantifying the evolutionary distance between...

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Computational Biology

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to High-Throughput Nucleotide Sequencing

Share to Models, Genetic

Share to Mutation

Share to Sequence Analysis, DNA

Source

Open in PubMed Open full text

Identifiers

PMID: 39530391
DOI: 10.1089/cmb.2024.0508
PMCID: PMC11698668

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 8 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

The Statistics of Parametrized Syncmers in a Simple Mutation Process Without Spurious Matches.PMID 39530391Read ↗

The Statistics of k-mers from a Sequence Undergoing a Simple Mutation Process Without Spurious Matches.Semantic proximity Read ↗

A k-mer-based estimator of the substitution rate between repetitive sequencesSemantic proximity Read ↗

DandD: efficient measurement of sequence growth and similaritySemantic proximity Read ↗

A run-length-compressed skiplist data structure for dynamic GBWTs supports time and space efficient pangenome operations over syncmersSemantic proximity Read ↗

Design of Worst-Case-Optimal Spaced SeedsSemantic proximity Read ↗

Allowing mutations in maximal matches boosts genome compression performance.Semantic proximity Read ↗

Compressive pangenomics using mutation-annotated networks.Semantic proximity Read ↗

Minimizer-space de Bruijn graphsSemantic proximity Read ↗

Sequence-specific minimizers via polar setsSemantic proximity Read ↗

A Perfect Match Genomic Landscape Provides a Unified Framework for the Precise Detection of Variation in Natural and Synthetic Haploid Genomes.Semantic proximity Read ↗

Long Single-Molecule Reads Can Resolve the Complexity of the Influenza Virus Composed of Rare, Closely Related Mutant Variants.Semantic proximity Read ↗

Mutation-Simulator: fine-grained simulation of random mutations in any genome.Semantic proximity Read ↗

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