Author:
Feijao Pedro,Meidanis Joao
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21(16), 3340–3346 (2005)
2. Lu, C.L., Huang, Y.L., Wang, T.C., Chiu, H.T.: Analysis of circular genome rearrangement by fusions, fissions and block-interchanges. BMC Bioinformatics 7, 295 (2006)
3. Mira, C., Meidanis, J.: Sorting by block-interchanges and signed reversals. In: ITNG 2007, pp. 670–676 (2007)
4. Dias, Z., Meidanis, J.: Genome rearrangements distance by fusion, fission, and transposition is easy. In: Proc. SPIRE 2001, pp. 250–253 (2001)
5. Meidanis, J., Dias, Z.: An Alternative Algebraic Formalism for Genome Rearrangements. In: Sankoff, D., Nadeau, J.H. (eds.) Comparative Genomics: Empirical and Analyitical Approaches to Gene Order Dynamics, Map Alignment and Evolution of Gene Families, pp. 213–223. Kluwer Academic Publishers (2000)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A symmetry-inclusive algebraic approach to genome rearrangement;Journal of Bioinformatics and Computational Biology;2021-11-19
2. Median Approximations for Genomes Modeled as Matrices;Bulletin of Mathematical Biology;2016-04
3. Lower Bounding Edit Distances between Permutations;SIAM Journal on Discrete Mathematics;2013-01
4. The Genesis of the DCJ Formula;Models and Algorithms for Genome Evolution;2013
5. On the Matrix Median Problem;Lecture Notes in Computer Science;2013