An improved genetic algorithm for problem of genome rearrangement

DOI10.1007/BF02836651MaRDI QIDQ5492501zbMATH OpenFDO

Authors Zhongxi Mo, Tao Zeng

Publication date 13 October 2006

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

Full work available at URL https://doi.org/10.1007/BF02836651

Mathematics Subject Classification ID

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

Recommendations

• Advances on sorting by reversals
• scientific article; zbMATH DE number 2073943
• Genome Rearrangements and Sorting by Reversals
• Signed genome rearrangement by reversals and transpositions: Models and approximations
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement

Cites work

• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Genome Rearrangements and Sorting by Reversals
• scientific article; zbMATH DE number 1303563 (Why is no real title available?)
• scientific article; zbMATH DE number 1557065 (Why is no real title available?)
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions

Cited in

(3)

• A new variant of genetic algorithm for solving gene selection problem
• scientific article; zbMATH DE number 5732413 (Why is no real title available?)
• scientific article; zbMATH DE number 2073943 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492501)