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

Allowing mutations in maximal matches boosts genome compression performance.

Bioinformatics (Oxford, England) - 15 Sept 2020

Liu Yuansheng, Wong Limsoon, Li Jinyan

Abstract excerpt

MOTIVATION: A maximal match between two genomes is a contiguous non-extendable sub-sequence common in the two genomes. DNA bases mutate very often from the genome of one individual to another. When a mutation occurs in a maximal match, it breaks the maximal match into shorter match segments. The coding cost using these broken segments for reference-based genome compression is much higher than that of using the...

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
Share to High-Throughput Nucleotide Sequencing

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Mutation

Share to Sequence Analysis, DNA

Share to Software

Source

Identifiers

PMID: 33118018
DOI: 10.1093/bioinformatics/btaa572

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 6 Sept 2026. Manifest publication-graph-cohort-2026-09-06.1.

Source receipt: pubmed, retrieved 6 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Allowing mutations in maximal matches boosts genome compression performance.PMID 33118018Read ↗

Optimized <i>k</i> -mer search across millions of bacterial genomes on laptopsSemantic proximity Read ↗

A pipeline for constructing reference genomes for large cohort-specific metagenome compressionSemantic proximity Read ↗

aaKomp: Alignment-free amino acid <i>k</i> -mer matching for genome completeness assessment at scaleSemantic proximity Read ↗

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

CRAM compression: practical across-technologies considerations for large-scale sequencing projectsSemantic proximity Read ↗

MetaProFi: A protein-based Bloom filter for storing and querying sequence data for accurate identification of functionally relevant genetic variantsSemantic proximity Read ↗

Comparative evaluation of computational methods for reconstruction of human viral genomesSemantic proximity Read ↗

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

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

Perfect Match Genomic Landscape strategy: Refinement and customization of reference genomes.Semantic proximity Read ↗

Navigating the pangenome coordinate system with ShredtoolsSemantic proximity Read ↗

The mutated subsequence problem and locating conserved genes.Semantic proximity Read ↗

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