Heuristics for Reversal Distance Between Genomes with Duplicated Genes

DOI10.1007/978-3-030-42266-0_3zbMath1500.92058OpenAlexW3013943885MaRDI QIDQ5041123

Zanoni Dias, Gabriel Siqueira, Klairton Lima Brito, Ulisses Dias

Publication date: 13 October 2022

Published in: Algorithms for Computational Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-42266-0_3

zbMATH Keywords

heuristicsgenome rearrangementreversalduplicated genes

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Genetics and epigenetics (92D10)

Related Items (2)

On the role of metaheuristic optimization in bioinformatics ⋮ Block reversal on finite words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating reversal distance for strings with bounded number of duplicates
• A very elementary presentation of the Hannenhalli-Pevzner theory
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• A genetic algorithm for the flexible job-shop scheduling problem
• Sorting Strings by Reversals and by Transpositions
• Transforming cabbage into turnip
• Parallel Genetic Algorithms Applied to the Traveling Salesman Problem
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• Reversals and Transpositions Over Finite Alphabets
• Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set

This page was built for publication: Heuristics for Reversal Distance Between Genomes with Duplicated Genes