Sorting Permutations by λ-Operations
For estimating the evolutionary distance between genomes of two different organisms, many sorting permutation problems have emerged. A well accepted way to do this is considering the smallest sequence of rearrangement events { mutations which affect large portions of the genomes { that transform one...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Graz University of Technology
2019-02-01
|
| Series: | Journal of Universal Computer Science |
| Subjects: | |
| Online Access: | https://lib.jucs.org/article/22578/download/pdf/ |