Name
Abstract | ||
|---|---|---|
Genome rearrangements are mutations affecting large portions of a genome, and a reversal is one of the most studied genome rearrangements in the literature through the Sorting by Reversals (SbR) problem. SbR is solvable in polynomial time on signed permutations (i.e., the gene orientation is known), and it is NP-hard on unsigned permutations. This problem (and many others considering genome rearra... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/TCBB.2020.2993002 | IEEE/ACM Transactions on Computational Biology and Bioinformatics |
Keywords | DocType | Volume |
Genomics,Bioinformatics,Sorting,Approximation algorithms,Electronic mail,Transforms,Time complexity | Journal | 18 |
Issue | ISSN | Citations |
6 | 1545-5963 | 0 |
PageRank | References | Authors |
0.34 | 0 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andre Rodrigues Oliveira | 1 | 0 | 6.76 |
| Géraldine Jean | 2 | 51 | 6.72 |
| Guillaume Fertin | 3 | 569 | 57.84 |
| Klairton Lima Brito | 4 | 0 | 3.72 |
| Laurent Bulteau | 5 | 95 | 12.43 |
| Ulisses Dias | 6 | 41 | 13.23 |
| Zanoni Dias | 7 | 262 | 44.40 |