ERC Starting Grant · 2021
Compressed Indexes for Regular Languages with Applications to Computational Pan-genomics
Sorting is, arguably, the most powerful algorithmic primitive when it comes to indexing data. At the same time, the regularities exposed by sorting are precisely those enabling data compression. In the last two decades, this fascinating duality has led researchers to the design of compressed full-text indexes: data structures supporting fast pattern matching queries over compressed text. In this project, we revisit the natural generalization of the problem to labeled graphs from a new perspective: we interpret graphs as finite-state automata and investigate the connections existing between their propensity to be sorted and the languages they recognize. Our novel language-theoretic approach…
From the public funding record at EU CORDIS. Describes the funded project, not the reviews below.