An improved genetic algorithm for problem of genome rearrangement

DOI10.1007/BF02836651zbMath1099.92056MaRDI QIDQ5492501

Zhongxi Mo, Tao Zeng

Publication date: 13 October 2006

Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Searching and sorting (68P10) Problems related to evolution (92D15) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Genetics and epigenetics (92D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• Genome Rearrangements and Sorting by Reversals
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals

This page was built for publication: An improved genetic algorithm for problem of genome rearrangement