Name
Abstract | ||
|---|---|---|
The preserving Genome Sorting Problem (pGSP) asks for a shortest sequence of rearrangement operations that transforms a given gene order into another given gene order by using rearrangement operations that preserve common intervals, i.e., groups of genes that form an interval in both given gene orders. The wpGSP is the weighted version of the problem were each type of rearrangement operation has a weight and a minimum weight sequence of rearrangement operations is sought. An exact algorithm - called CREx2 - is presented, which solves the wpGSP for arbitrary gene orders and the following types of rearrangement operations: inversions, transpositions, inverse transpositions, and tandem duplication random loss operations. CREx2 has a (worst case) exponential runtime, but a linear runtime for problem instances where the common intervals are organized in a linear structure. The efficiency of CREx2 and its usefulness for phylogenetic analysis is shown empirically for gene orders of fungal mitochondrial genomes. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/TCBB.2018.2831661 | IEEE/ACM transactions on computational biology and bioinformatics |
Keywords | Field | DocType |
Genomics,Bioinformatics,Sorting,Runtime,Heuristic algorithms,5G mobile communication,Transforms | Genome,Combinatorics,Exact algorithm,Gene orders,Computer science,Genomics,Sorting,Linear complex structure,Order by,Artificial intelligence,Minimum weight,Machine learning | Journal |
Volume | Issue | ISSN |
16 | 1 | 1557-9964 |
Citations | PageRank | References |
1 | 0.36 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hartmann, T. | 1 | 3 | 1.75 |
| Matthias Bernt | 2 | 77 | 11.06 |
| M. Middendorf | 3 | 594 | 52.26 |