6 citations · 6 across the 3 of their papers we have counts for
5 papers
Closing the complexity gap of the double distance problem
Luís Cunha, Thiago Lopes, Uéverton Souza +3
Genome rearrangement has been an active area of research in computational comparative genomics for the last three decades. While initially mostly an interesting algorithmic endeavo…
Investigating the complexity of the double distance problems
Marilia D. V. Braga, Leonie R. Brockmann, Katharina Klerx +1
Two genomes over the same set of gene families form a canonical pair when each of them has exactly one gene from each family. Different distances of canonical genomes can be derive…
Natural family-free genomic distance
Diego P. Rubert, Fábio V. Martinez, Marília D. V. Braga
A classical problem in comparative genomics is to compute the rearrangement distance, that is the minimum number of large-scale rearrangements required to transform a given genome…
Computing the rearrangement distance of natural genomes
Leonard Bohnenkämper, Marília D. V. Braga, Daniel Doerr +1
The computation of genomic distances has been a very active field of computational comparative genomics over the last 25 years. Substantial results include the polynomial-time comp…
Computing the Inversion-Indel Distance
Eyla Willing, Jens Stoye, Marília D. V. Braga
The inversion distance, that is the distance between two unichromosomal genomes with the same content allowing only inversions of DNA segments, can be exactly computed thanks to a…