References
- V. Bafna, P. Pevzner, Genome rearrangements and sorting by reversals, SLAM J. Comput. 25 (2), pp. 272-289, 1996 https://doi.org/10.1137/S0097539793250627
- V. Bafna, P. Pevzner, Sorting by transpositions, SLAM J. Discrete Math, pp. 224-240, 1998 https://doi.org/10.1137/S089548019528280X
- P. Berman and S. Hannenhalli, Fast sorting by reversals, In Proc. Combinational Pattern Matching(CPM'96), pp. 168-185, 1996
- Q. Gu, S. Peng, H. Sudborough, A 2-approximation algorithm for genome rearrangements by reversals and transpositions, Theoretical Computer Science, pp. 327-339, 1999 https://doi.org/10.1016/S0304-3975(98)00092-9
- S. Hannenhanlli, P. Pevzner, Transforming cabbage into turnip (polynomial algorithm for sorting signed permutation by reversals), Proc. 27th ACM symp. on Theory of Computing(STOC'95), pp. 178-189, 1995
- H. Kaplan, R. Shamir, R. Tarjan, Faster and simpler algorithm for sorting signed permutation by reversals, In Proc. ACM-SLAM Symp. on Discrete Algorithms (SODA'97), pp. 344-351, 1997, also: Proc. RECOMB'97
- S. Karlin, E.S. Mocarski, G.A. Schachtel, Molecular evolution of herpesviruses: genomic and protein sequence comparisions, J. Virol. 68, pp. 1886-1902, 1994
- J. Kececioglu, D. Sankoff, Exact and approximation algorithms for the inversion distance between two permutations, Algorithmica 13, pp.180-210, 1995
- J.D. Palmer, L.A. Herbon, Plant mitochondrical DNA evolves rapidly in structure, but siowly in sequence, J. Mol. Evol. 27, pp. 87-97, 1988 https://doi.org/10.1007/BF02143500