3 papers
cs.CC2025
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.CC2025
Complexity of the Swap Median and Swap Closest Problems
LuÃs Cunha, Thiago Lopes, Arnaud Mary
Genome rearrangement distances provide a combinatorial framework for comparing genomes represented as permutations. Although the swap distance between two permutations is polynomia…
cs.CC2025
Determining subtree movement distance and consensus between cell trees
LuÃs Cunha, Jack Kuipers, Thiago Lopes
Tumor mutational heterogeneity can be represented by trees describing the evolutionary history of a tumor. However, noisy sequencing data may create uncertainty in the inferred tre…