3 papers
cs.CC2024
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…
cs.DS2020
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…
cs.DS2019
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…