5 citations · 5 across the 2 of their papers we have counts for
4 papers
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…
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…
On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching
Massimo Equi, Roberto Grossi, Alexandru I. Tomescu +1
Exact pattern matching in labeled graphs is the problem of searching paths of a graph that spell the same string as the given pattern . This basic problem can be…
On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree
Massimo Equi, Roberto Grossi, Veli Mäkinen
Exact pattern matching in labeled graphs is the problem of searching paths of a graph that spell the same string as the pattern . This basic problem can be found…