The Community for Technology Leaders
RSS Icon
Issue No.02 - April-June (2010 vol.7)
pp: 365-374
Xingqin Qi , Shandong University at Weihai, Weihai
Guojun Li , University of Georgia, Athens
Shuguang Li , Shandong Institute of Business and Technology, Yantai
Ying Xu , University of Georgia, Athens
The problem of sorting by reciprocal translocations (abbreviated as SBT) arises from the field of comparative genomics, which is to find a shortest sequence of reciprocal translocations that transforms one genome \Pi into another genome \Gamma, with the restriction that \Pi and \Gamma contain the same genes. SBT has been proved to be polynomial-time solvable, and several polynomial algorithms have been developed. In this paper, we show how to extend Bergeron's SBT algorithm to include insertions and deletions, allowing to compare genomes containing different genes. In particular, if the gene set of \Pi is a subset (or superset, respectively) of the gene set of \Gamma, we present an approximation algorithm for transforming \Pi into \Gamma by reciprocal translocations and deletions (insertions, respectively), providing a sorting sequence with length at most OPT + 2, where OPT is the minimum number of translocations and deletions (insertions, respectively) needed to transform \Pi into \Gamma; if \Pi and \Gamma have different genes but not containing each other, we give a heuristic to transform \Pi into \Gamma by a shortest sequence of reciprocal translocations, insertions, and deletions, with bounds for the length of the sorting sequence it outputs. At a conceptual level, there is some similarity between our algorithm and the algorithm developed by El Mabrouk which is used to sort two chromosomes with different gene contents by reversals, insertions, and deletions.
Translocation, insertion, deletion, algorithm.
Xingqin Qi, Guojun Li, Shuguang Li, Ying Xu, "Sorting Genomes by Reciprocal Translocations, Insertions, and Deletions", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.7, no. 2, pp. 365-374, April-June 2010, doi:10.1109/TCBB.2008.53
[1] S. Hannenhalli and P. Pevzner, "Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals," J. ACM, vol. 46, no. 1-27, 1999.
[2] P. Berman and S. Hannenhalli, "Fast Sorting by Reversal," Proc. Seventh Ann. Symp. Combinatorial Pattern Matching (CPM' 96), pp. 168-185, June 1996.
[3] H. Kaplan, R. Shamir, and R.E. Tarjan, "Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals," Proc. Eighth Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '97), pp. 344-351, Jan. 1997.
[4] A. Bergeron, "A Very Elementary Presentation of the Hannenhalli-Pevzner Theory," Discrete Applied Math., vol. 146, no. 2, pp. 134-145, 2005.
[5] H. Kaplan and E. Verbin, "Sorting Signed Permutations by Reversals, Revisited," J. Computer and System Sciences, vol. 70, no. 3, pp. 321-341, 2005.
[6] E. Tannier, A. Bergeron, and M. Sagot, "Advances on Sorting by Reversals," Discrete Applied Math., vol. 155, nos. 6-7, pp. 881-888, 2007.
[7] J.D. Kececioglu and R. Ravi, "Of Mice and Men: Algorithms for Evolutionary Distance between Genomes with Translocation," Proc. Sixth ACM-SIAM Symp. Discrete Algorithm (SODA '95), pp. 604-613, Jan. 1995.
[8] S. Hannenhalli, "Polynomial Algorithm for Computing Translocation Distance between Genomes," Discrete Applied Math., vol. 71, pp. 137-151, 1996.
[9] A. Bergeron, J. Mixtacki, and J. Stoye, "On Sorting by Translocations," J. Computational Biology, vol. 13, no. 2, pp. 567-578, 2006.
[10] L. Wang, D. Zhu, X. Liu, and S. Ma, "An $O(n^{2})$ Algorithm for Signed Translocation," J. Computer and System Sciences, vol. 70, no. 3, pp. 284-299, 2005.
[11] M. Ozery-Flato and R. Shamir, "Sorting by Translocations via Reversals Theory," Proc. Fourth RECOMB Satellite Workshop Comparative Genomics (RECOMB '06), pp. 87-98, Apr. 2006.
[12] M. Ozery-Flato and R. Shamir, "An $O(n\sqrt{n\log n})$ Algorithm for Sorting by Reciprocal Translocations," Proc. 17th Ann. Symp. Combinatorial Pattern Matching (CPM '06), pp. 258-269, July 2006.
[13] N. El-Mabrouk, "Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments," Proc. 11th Ann. Symp. Combinatorial Pattern Matching (CPM '00), pp. 222-234, June 2000.
30 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool