Sorting permutations by fragmentation-weighted operations.

Abstract excerpt

One of the main problems in Computational Biology is to find the evolutionary distance among species. In most approaches, such distance only involves rearrangements, which are mutations that alter large pieces of the species' genome. When we represent genomes as permutations, the problem of transforming one genome into another is equivalent to the problem of Sorting Permutations by Rearrangement Operations. The...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Computational Biology
• Share to Gene Rearrangement