An improved chromosome sorting algorithm by permutation group-based inverted block-interchanges
In comparative genomics, a common issue is to find the shortest course of operations for the
transformation of one genome into another. During rejoining the blocks, inverted block …
transformation of one genome into another. During rejoining the blocks, inverted block …
[PDF][PDF] Improving the Performance of a Genome Sorting Algorithm with Inverted Block-Interchange.
A classic problem in comparative genomics is to find a shortest sequence of evolutionary
operations that transform one genome into another. There are different types of genome …
operations that transform one genome into another. There are different types of genome …