Name
Abstract | ||
|---|---|---|
The weighted Genome Sorting Problem (wGSP) is to find a minimum-weight sequence of rearrangement operations that transforms a given gene order into another given gene order using rearrangement operations that are associated with a predefined weight. This paper presents a polynomial sized Integer Linear Program -called GeRe-ILP- for solving the wGSP for the following three types of rearrangement o... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TCBB.2017.2708121 | IEEE/ACM Transactions on Computational Biology and Bioinformatics |
Keywords | Field | DocType |
Genomics,Bioinformatics,Sorting,Approximation algorithms,Biological cells,Transforms,DNA | Integer,Approximation algorithm,Inverse,Weighting,Polynomial,Gene orders,Algorithm,Sorting,Linear programming,Bioinformatics,Mathematics | Journal |
Volume | Issue | ISSN |
15 | 5 | 1545-5963 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tom Hartmann | 1 | 1 | 0.69 |
| Nicolas Wieseke | 2 | 114 | 9.34 |
| Roded Sharan | 3 | 2792 | 186.61 |
| M. Middendorf | 4 | 594 | 52.26 |
| Matthias Bernt | 5 | 77 | 11.06 |