该博客介绍了一种衡量DNA序列“未排序程度”的方法，即计算序列中的逆序对数量。任务是按“排序度”对DNA序列进行排序，从最接近排序到最不接近排序。输入包含DNA序列的长度和数量，输出是按排序度排列的序列。文章提供了一个使用C++实现的选择排序算法来解决这个问题。
Description
One measure of ``unsortedness'' in a sequence is the number of pairs of entries that are out of order with respect to each other. For instance, in the letter sequence ``DAABEC'', this measure is 5, since D is greater than four letters to its right and E is greater than one letter to its right. This measure is called the number of inversions in the sequence. The sequence ``AACEDGG'' has only one inversion (E and D)---it is nearly sorted---while the sequence ``ZWQM'' has 6 inversions (it is as unsorted as can be---exactly the reverse of sorted).
You are responsible for cataloguing a sequence of DNA strings (sequences containing only the four letters A, C, G, and T). However, you want to catalog them, not in alphabetical order, but rather in order of ``sortedness'', from ``most sorted'' to ``least sorted''. All the
最低0.47元/天 解锁文章
180
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
