5 citations · 6 across the 2 of their papers we have counts for
5 papers
Lempel-Ziv-like Parsing in Small Space
Dmitry Kosolobov, Daniel Valenzuela, Gonzalo Navarro +1
Lempel-Ziv (LZ77 or, briefly, LZ) is one of the most effective and widely-used compressors for repetitive texts. However, the existing efficient methods computing the exact LZ pars…
Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics
Romeo Rizzi, Massimo Cairo, Veli Mäkinen +2
Covering alignment problems arise from recent developments in genomics; so called pan-genome graphs are replacing reference genomes, and advances in haplotyping enable full content…
Interval scheduling maximizing minimum coverage
Veli Mäkinen, Valeria Staneva, Alexandru Tomescu +1
In the classical interval scheduling type of problems, a set of jobs, characterized by their start and end time, need to be executed by a set of machines, under various constra…
Compressed Spaced Suffix Arrays
Travis Gagie, Giovanni Manzini, Daniel Valenzuela
Spaced seeds are important tools for similarity search in bioinformatics, and using several seeds together often significantly improves their performance. With existing approaches,…
Practical Top-K Document Retrieval in Reduced Space
Gonzalo Navarro, Daniel Valenzuela
Supporting top-k document retrieval queries on general text databases, that is, finding the k documents where a given pattern occurs most frequently, has become a topic of interest…