Author:
Brito Klairton Lima,Oliveira Andre Rodrigues,Alexandrino Alexsandro Oliveira,Dias Ulisses,Dias Zanoni
Reference14 articles.
1. Berman, P., Hannenhalli, S., Karpinski, M., 2002. 1.375-Approximation Algorithm for Sorting by Reversals, in: Möhring, R., Raman, R. (Eds.), Proceedings of the 10th Annual European Symposium on Algorithms (ESA’2002). Springer-Verlag Berlin Heidelberg New York, Berlin/Heidelberg, Germany. volume 2461 of Lecture Notes in Computer Science, pp. 200–210.
2. Breaking Good: Accounting for Fragility of Genomic Regions in Rearrangement Distance Estimation;Biller;Genome Biology and Evolution,2016
3. Comparative Genomics on Artificial Life;Biller,2016
4. Sorting by Genome Rearrangements on both Gene Order and Intergenic Sizes;Brito;Journal of Computational Biology,2020
5. Sorting by Transpositions is Difficult;Bulteau;SIAM Journal on Discrete Mathematics,2012
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献