Parallel Strategy for Exploring the Solution Space of Sorting by Reversals

• Published in: ARTCom 2012 : fourth International Conference on Advances in Recent Technologies in Communication and Computing : 19-20 October 2012 pp. 66 - 69
• Main Authors: Amritanjali, Sahoo, G
• Format: Conference Proceeding
• Language: English
• Published: Stevenage, UK IET 2012; The Institution of Engineering & Technology
• Subjects: Biology and medical computing; Computational complexity; Parallel software; parallel algorithms; genomic mutations; reversal sorting; solution space; parallel strategy; signed permutation sorting; comparative genomics; exponential complexity; biology computing; sorting; genomics; polynomial time solution; computational complexity
• ISBN: 9781849199292; 1849199299
• DOI: 10.1049/cp.2012.2496

The problem of sorting a signed permutation by reversals is inspired and motivated by comparative genomics. In comparative genomics, algorithms that sort a signed permutation by reversals are often used to propose evolutionary scenarios of large-scale genomic mutations between species. Following the first polynomial time solution of this problem, several improvements has been published on the subject. In 2008, Braga et al. proposed an algorithm to perform the enumeration of traces that sort a signed permutation by reversals. This algorithm has exponential complexity in both time and space. In this paper, we propose a parallel approach to address this problem.