Name
Abstract | ||
|---|---|---|
All problems considering SSOs in permutations have been shown to be in , except for one, namely sorting signed circular permutations by super short reversals and super short transpositions. Here we fill this gap by introducing a new graph structure called and providing a series of intermediate results, which allows us to design a polynomial algorithm for sorting signed circular permutations by super short reversals and super short transpositions. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1186/s13015-018-0131-6 | Algorithms for Molecular Biology |
Keywords | Field | DocType |
Genome rearrangements,Super short operations,Circular permutations | Genome,Transposition (music),Combinatorics,Integer (computer science),Computer science,sort,Permutation,Genome rearrangement,Sorting,Without loss of generality,Genetics | Journal |
Volume | Issue | ISSN |
13 | 1 | 1748-7188 |
Citations | PageRank | References |
0 | 0.34 | 13 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andre Rodrigues Oliveira | 1 | 0 | 6.76 |
| Guillaume Fertin | 2 | 569 | 57.84 |
| Ulisses Dias | 3 | 41 | 13.23 |
| Zanoni Dias | 4 | 262 | 44.40 |