Abstract
Translocation is a prevalent rearrangement event in the evolution of multi-chromosomal species which exchanges ends between two chromosomes. A translocation is reciprocal if none of the exchanged ends is empty; otherwise, non-reciprocal. Given two signed multi-chromosomal genomes A and B, the problem of sorting by translocations is to find a shortest sequence of translocations transforming A into B. Several polynomial algorithms have been presented, all of them only allowing reciprocal translocations. Thus they can only be applied to a pair of genomes having the same set of chromosome ends. Such a restriction can be removed if non-reciprocal translocations are also allowed. In this paper, for the first time, we study the problem of sorting by generalized translocations, which allows both reciprocal translocations and non-reciprocal translocations. We present an exact formula for computing the generalized translocation distance, which leads to a polynomial algorithm for this problem.
Supported by (1) National Nature Science Foundation of China, 60573024. (2) Chinese National 973 Plan, previous special, 2005cca04500.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bafna, V., Pevzner, P.: Sorting by reversals: Genome rearrangements in plant organelles and evolutionary history of x chromosome. Molecular Biology Evolution 12, 239–246 (1995)
Hannenhalli, S., Pevzner, P.: Transforming men into mice: Polynomial algorithm for genomic distance problem. In: Proc. 36th Ann. Symp. Foundations of Computer Science (FOCS 1995), pp. 581–592 (1995)
Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM 46, 1–27 (1999)
Kececioglu, J.D., Ravi, R.: of mice and men: Algorithms for evolutionary distance between genomes with translocation. In: Proc. 6th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA 1995), pp. 604–613 (1995)
Hannenhalli, S.: Polynomial algorithm for computing translocation distance between genomes. Discrete Applied Mathematics 71, 137–151 (1996)
Bergeron, A., Mixtacki, J., Stoye, J.: On sorting by translocations. Journal of Computational Biology 13, 567–578 (2006)
Zhu, D.M., Ma, S.H.: Improved polynomial-time algorithm for computing translocation distance between genomes. The Chinese Journal of Computers 25, 189–196 (2002)
Wang, L.S., Zhu, D.M., Liu, X.W., Ma, S.H.: An O(n 2) algorithm for signed translocation. Journal of Computer and System Sciences 70, 284–299 (2005)
Ozery-Flato, M., Shamir, R.: An \(n^{3/2}\sqrt{log(n)}\) algorithm for sorting by reciprocal translocations. In: Proc. 17th Ann. Symp. Combinatorial Pattern Matching (CPM 2006), pp. 258–269 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yin, X., Zhu, D. (2009). Polynomial-Time Algorithm for Sorting by Generalized Translocations. In: Chen, J., Cooper, S.B. (eds) Theory and Applications of Models of Computation. TAMC 2009. Lecture Notes in Computer Science, vol 5532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02017-9_46
Download citation
DOI: https://doi.org/10.1007/978-3-642-02017-9_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02016-2
Online ISBN: 978-3-642-02017-9
eBook Packages: Computer ScienceComputer Science (R0)