research
∙
06/08/2023
Longest Common Prefix Arrays for Succinct k-Spectra
The k-spectrum of a string is the set of all distinct substrings of leng...
share
research
∙
08/31/2022
Computing all-vs-all MEMs in run-length encoded collections of HiFi reads
We describe an algorithm to find maximal exact matches (MEMs) among HiFi...
research
∙
08/24/2022
Hierarchical Relative Lempel-Ziv Compression
Relative Lempel-Ziv (RLZ) parsing is a dictionary compression method in ...
research
∙
07/03/2022
Suffix sorting via matching statistics
We introduce a new algorithm for constructing the generalized suffix arr...
research
∙
01/18/2022
Computing Longest (Common) Lyndon Subsequences
Given a string T with length n whose characters are drawn from an ordere...
research
∙
02/28/2021
Weighted Ancestors in Suffix Trees Revisited
The weighted ancestor problem is a well-known generalization of the pred...
research
∙
04/09/2020
Pattern Discovery in Colored Strings
We consider the problem of identifying patterns of interest in colored s...
research
∙
02/28/2020
Fast Indexes for Gapped Pattern Matching
We describe indexes for searching large data sets for variable-length-ga...
research
∙
03/05/2019
Lempel-Ziv-like Parsing in Small Space
Lempel-Ziv (LZ77 or, briefly, LZ) is one of the most effective and widel...
research
∙
05/25/2018
Algorithms for Anti-Powers in Strings
A string S[1,n] is a power (or tandem repeat) of order k and period n/k ...
research
∙
05/14/2018
Assembling Omnitigs using Hidden-Order de Bruijn Graphs
De novo DNA assembly is a fundamental task in Bioinformatics, and findin...
research
∙
11/08/2017
