Concepedia
Algorithms for Molecular Biology · 2017 · 14 citations · 10 references
Open access
Experiments on simulated data sets show that our approximation algorithm is very competitive both in efficiency and in quality of the solutions.
10
Efficient sorting of genomic permutations by translocation, inversion and block interchange
Sophia Yancopoulos, Oliver Attie, R. Friedberg · Computer applications in the biosciences · 2005 · 493 citations · Full text
Optimal suffix tree construction with large alphabets
2002 · 442 citations
Tree Language, Combinatorics On Word, Engineering +15
An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes
Mingfu Shao, Yu Lin, Bernard M. E. Moret · Journal of Computational Biology · 2014 · 94 citations · Full text
Comparative Genomics, Genetics, Exact Algorithm +23
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Tzvika Hartman, Ron Shamir · Information and Computation · 2005 · 64 citations
Computational Science, Engineering, Approximate Computing +9
Approximating the true evolutionary distance between two genomes
Krister M. Swenson, Mark Marron, Joel V. Earnest-DeYoung et al. · ACM Journal of Experimental Algorithmics · 2008 · 61 citations
Comparative Genomics, Genetics, Genomics +17