Showing 2024Show all
3 papers · 1 filter
cs.DS2024
Binary Jumbled Indexing: Suffix tree histogram
Luís Cunha, Mário Medina
Given a binary string over the alphabet , a vector is a Parikh vector if and only if a factor of contains exactly occurrences of and occurren…
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.CC2024
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…