An improved chromosome sorting algorithm by permutation group-based inverted block-interchanges
No Thumbnail Available
Date
2016-12
Journal Title
Journal ISSN
Volume Title
Publisher
© 2016 IEEE
Abstract
In comparative genomics, a common issue is to find the shortest course of operations for the transformation of one genome into another. During rejoining the blocks, inverted block interchange, a more distinct form of block interchange, gives the option to the blocks to reverse their orientation. In this particular paper, we have presented an improved algorithm to sort circular chromosomes by inverted block interchanges and also compared the performances with a previous algorithm. Our experimental findings justify the fact that accommodation of inverted block interchange ensures results with equal or less number of series of operations in terms of block interchanges.
Description
This conference paper was published in the IEEE Xplore [© 2016 IEEE] and the definite version is available at : http://doi.org/10.1109/MEDITEC.2016.7835373 The Journal's website is at: http://ieeexplore.ieee.org/document/7835373/
Keywords
Chromosome, Genome, Inverted block interchange, Permutation group
Citation
Tabassum, A., Abdullah, W. M., Manjur, N., Islam, R., Ahmed, A., Morshed, S. I., . . . Islam, M. N. (2017). An improved chromosome sorting algorithm by permutation group-based inverted block-interchanges. Paper presented at the 1st International Conference on Medical Engineering, Health Informatics and Technology, MediTec 2016, 10.1109/MEDITEC.2016.7835373