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

A Dynamic Programming Algorithm For (1,2)-Exemplar Breakpoint Distance.

Journal of computational biology : a journal of computational molecular cell biology - 1 Jul 2015

Wei Zhexue, Zhu Daming, Wang Lusheng

Abstract excerpt

The exemplar breakpoint distance problem is motivated by finding conserved sets of genes between two genomes. It asks to find respective exemplars in two genomes to minimize the breakpoint distance between them. If one genome has no repeated gene (called trivial genome) and the other has genes repeating at most twice, it is referred to as the (1, 2)-exemplar breakpoint distance problem, EBD(1, 2) for short....

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Base Sequence
Share to Computer Simulation

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Conserved Sequence

Share to Genome

Share to Models, Genetic

Share to Sequence Analysis, DNA

Share to Software

Source

Identifiers

PMID: 26161597
DOI: 10.1089/cmb.2014.0200

Provenance

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

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

A Dynamic Programming Algorithm For (1,2)-Exemplar Breakpoint Distance.PMID 26161597Read ↗

The zero exemplar distance problem.Semantic proximity Read ↗

Longest Order Conserved Exemplar SubsequencesSemantic proximity Read ↗

A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions.Semantic proximity Read ↗

The distribution of distances between randomly constructed genomes: generating function, expectation, variance and limits.Semantic proximity Read ↗

Rearrangement distance with reversals, indels, and moves in intergenic regions on signed and unsigned permutations.Semantic proximity Read ↗

On Deriving Synteny Blocks by Compacting ElementsSemantic proximity Read ↗

The infinite sites model of genome evolution.Semantic proximity Read ↗

Reconciliation of gene and species trees.Semantic proximity Read ↗

Alignment-free comparison of genome sequences by a new numerical characterization.Semantic proximity Read ↗

Genome halving and double distance with losses.Semantic proximity Read ↗

A general heuristic for genome rearrangement problems.Semantic proximity Read ↗

Sets of medians in the non-geodesic pseudometric space of unsigned genomes with breakpoints.Semantic proximity Read ↗

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