Loading...
Please wait, while we are loading the content...
Similar Documents
Approximation Algorithms for Sorting λ-Permutations by λ-Operations
| Content Provider | MDPI |
|---|---|
| Author | Miranda, Guilherme Alexandrino, Alexsandro Lintzmayer, Carla Dias, Zanoni |
| Copyright Year | 2021 |
| Abstract | Understanding how different two organisms are is one question addressed by the comparative genomics field. A well-accepted way to estimate the evolutionary distance between genomes of two organisms is finding the rearrangement distance, which is the smallest number of rearrangements needed to transform one genome into another. By representing genomes as permutations, one of them can be represented as the identity permutation, and, so, we reduce the problem of transforming one permutation into another to the problem of sorting a permutation using the minimum number of rearrangements. This work investigates the problems of sorting permutations using reversals and/or transpositions, with some additional restrictions of biological relevance. Given a value |
| Starting Page | 175 |
| e-ISSN | 19994893 |
| DOI | 10.3390/a14060175 |
| Journal | Algorithms |
| Issue Number | 6 |
| Volume Number | 14 |
| Language | English |
| Publisher | MDPI |
| Publisher Date | 2021-06-01 |
| Access Restriction | Open |
| Subject Keyword | Algorithms Genetics Genome Rearrangements Approximation Algorithms Sorting Permutations |
| Content Type | Text |
| Resource Type | Article |