Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Sorting by reversals is difficult
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Polynomial time approximation schemes for dense instances of NP -hard problems
Journal of Computer and System Sciences
To cut…or not to cut (applications of comparative physical maps in molecular evolution)
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for multichromosomal genome rearrangements
Journal of Computer and System Sciences - Computational biology 2002
Exact and Approximation Algorithms for the Inversion Distance Between Two Chromosomes
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
RCG'05 Proceedings of the 2005 international conference on Comparative Genomics
Removing Noise and Ambiguities from Comparative Maps in Rearrangement Analysis
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |
Measures of distance between genomic maps are inflated by high levels of noise due to incorrectly resolved paralogy and error at the mapping, sequencing and alignment levels. Comparison is also hampered by lack of information on gene orientation and lack gene order. We suggest a suite of algorithms for genome rearrangement analysis in the presence of noise and incomplete information, and test its robustness as noise levels increase.