An index for a finite automaton is a powerful data structure that supports locating paths
labeled with a query pattern, thus solving pattern matching on the underlying regular …

The string matching problem on a node-labeled graph G=(V, E) asks whether a given
pattern string P equals the concatenation of node labels of some path in G. This is a basic …

For the first time we provide a succinct pattern matching index for arbitrary graphs that can
be built in polynomial time, while improving both space and query time bounds from SODA …

The recently introduced class of Wheeler graphs, inspired by the Burrows-Wheeler
Transform (BWT) of a given string, admits an efficient index data structure for searching for …

The Burrows-Wheeler Transform (BWT) has been an essential tool in text compression and
indexing. First introduced in 1994, it went on to provide the backbone for the first encoding of …

We introduce a compact pangenome representation based on an optimal segmentation
concept that aims to reconstruct founder sequences from a multiple sequence alignment …

In recent years several compressed indexes based on variants of the Burrows-Wheeler
transformation have been introduced. Some of these index structures far more complex than …

The states of a finite-state automaton 𝒩 can be identified with collections of words in the
prefix closure of the regular language accepted by 𝒩. But words can be ordered, and among …

Matching statistics were introduced to solve the approximate string matching problem, which
is a recurrent subroutine in bioinformatics applications. In 2010, Ohlebusch et al.[SPIRE …

Exact string matching in labeled graphs is the problem of searching paths of a graph G=(V,
E) such that the concatenation of their node labels is equal to a given pattern string P [1. m] …