Sorting by bounded permutations
Sorting by bounded permutations
Sorting permutations by tanspositions
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Sorting by Prefix Transpositions
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
A New Approach for Approximating the Transposition Distance
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation
New Bounds and Tractable Instances for the Transposition Distance
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Faster algorithms for sorting by transpositions and sorting by block interchanges
ACM Transactions on Algorithms (TALG)
Whole genome duplications, multi-break rearrangements, and genome halving problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Multi-break rearrangements and chromosomal evolution
Theoretical Computer Science
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation
Extending Bafna-Pevzner algorithm
ISB '10 Proceedings of the International Symposium on Biocomputing
Multi-break rearrangements: from circular to linear genomes
RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
Faster algorithms for sorting by transpositions and sorting by block-interchanges
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
A new tight upper bound on the transposition distance
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
| Hi-index | 0.00 |
In computational biology, genome rearrangements is a field in which we investigate the combinatorial problem of sorting by transpositions. This problem consists in finding the minimum number of transpositions (mutational event) that transform a chromosome into another. In this work, we implement the 1.5-approximation algorithm proposed by Christie [2] for solving this problem, introducing modifications to reduce its time complexity, and we also propose heuristics to further improve its performance. Comparing our experimental results with the best known results, we had better performance. This work targets to contribute for discovering the complexity of the problem of sorting by transpositions, which remains open.