Editing Estimating Genome Reversal Distance by Genetic Algorithm

Title: Estimating Genome Reversal Distance by Genetic Algorithm

Research Question: How can we estimate the genome reversal distance between two genomes using a genetic algorithm?

Methodology: The researchers used a genetic algorithm to solve the problem of sorting unsigned permutation by reversal. They first modeled the unsigned permutation as a breakpoint graph, marking the desired and realistic relationship between nodes in the permutation. They then used a genetic algorithm to search for the optimal signed permutation in all n2 corresponding signed permutations.

Results: The experimental results showed that the proposed method outperformed the 3/2-approximation algorithm, providing better solutions for sorting unsigned permutation by reversal.

Implications: This research has implications for the field of genome rearrangement, as it offers an alternative approach to estimating the genome reversal distance between two genomes. It also contributes to the ongoing efforts to improve the efficiency and accuracy of heuristic algorithms for sorting permutations by reversal.

Link to Article: https://arxiv.org/abs/0405014v1
Authors: 
arXiv ID: 0405014v1

[[Category:Computer Science]]
[[Category:Reversal]]
[[Category:Algorithm]]
[[Category:Permutation]]
[[Category:Genome]]
[[Category:By]]