Listing Sorting Sequences of Reversals and Translocations

Authors:
Amritanjali;G. Sahoo
Affiliations:
Department of CSE, Birla Institute of Technology, Ranchi, Jharkhand, India-835215 +919430779843;Department of IT, Birla Institute of Technology, Ranchi, Jharkhand, India-835215 +919431187542
Venue:
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Year:
2013

Citing 5
Cited 0

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
Polynomial-time algorithm for computing translocation distance between genomes

Discrete Applied Mathematics - Special volume on computational molecular biology
Transforming men into mice (polynomial algorithm for genomic distance problem)

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Exploring the Solution Space of Sorting by Reversals, with Experiments and an Application to Evolution

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Sorting Genomes by Reversals and Translocations

APCIP '09 Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02

Quantified Score

Hi-index	0.00

Visualization

Abstract

Algorithms for sorting by reversals and translocations (SBRT) are often used to propose evolutionary scenarios of multichromosomal genomes. The existing algorithms for the SBRT problem provide a single sorting sequence of reversals and translocations. In this paper we propose multiple solutions for the problem and present a methodology to list all possible sorting sequences of reversals and translocations for a given pair of genomes without knots. Listing all the sorting sequences is useful in assessing the biological merits of various parsimonious rearrangement scenarios.