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 general heuristic for genome rearrangement problems.

Journal of bioinformatics and computational biology - 1 Jun 2014

Dias Ulisses, Galvão Gustavo Rodrigues, Lintzmayer Carla Négri, Dias Zanoni

Abstract excerpt

In this paper, we present a general heuristic for several problems in the genome rearrangement field. Our heuristic does not solve any problem directly, it is rather used to improve the solutions provided by any non-optimal algorithm that solve them. Therefore, we have implemented several algorithms described in the literature and several algorithms developed by ourselves. As a whole, we implemented 23 algorithms...

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
Share to Databases, Genetic

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to DNA Transposable Elements

Share to Gene Rearrangement

Share to Models, Genetic

Share to Mutation

Source

Identifiers

PMID: 24969750
DOI: 10.1142/S0219720014500127

Provenance

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

Source receipt: pubmed, retrieved 5 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

A general heuristic for genome rearrangement problems.PMID 24969750Read ↗

Sorting permutations by prefix and suffix rearrangements.Semantic proximity Read ↗

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

Reversals and transpositions distance with proportion restriction.Semantic proximity Read ↗

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

Sorting permutations by fragmentation-weighted operations.Semantic proximity Read ↗

Restricted DCJ model: rearrangement problems with chromosome reincorporation.Semantic proximity Read ↗

Sorting by restricted-length-weighted reversals.Semantic proximity Read ↗

Sorting Signed Permutations by Intergenic Reversals.Semantic proximity Read ↗

Restricted DCJ-indel model: sorting linear genomes with DCJ and indels.Semantic proximity Read ↗

Ancestral genome inference using a genetic algorithm approach.Semantic proximity Read ↗

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

On the rank-distance median of 3 permutations.Semantic proximity Read ↗

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