5 citations · 8 across the 7 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020
Linear Time Construction of Indexable Founder Block Graphs
Veli Mäkinen, Bastien Cazaux, Massimo Equi +2
We introduce a compact pangenome representation based on an optimal segmentation concept that aims to reconstruct founder sequences from a multiple sequence alignment (MSA). Such f…
cs.CC2020
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu
We consider the following string matching problem on a node-labeled graph : given a pattern string , decide whether there exists a path in whose concatenation of no…