[HTML][HTML] Wheeler graphs: A framework for BWT-based data structures
Abstract The famous Burrows–Wheeler Transform (BWT) was originally defined for a single
string but variations have been developed for sets of strings, labeled trees, de Bruijn graphs …
string but variations have been developed for sets of strings, labeled trees, de Bruijn graphs …
On the hardness and inapproximability of recognizing wheeler graphs
D Gibney, SV Thankachan - ar** indexing
Text indexing is a fundamental problem in computer science. The objective is to preprocess
a text T, so that, given a pattern P, we can find all starting positions (or simply, occurrences) …
a text T, so that, given a pattern P, we can find all starting positions (or simply, occurrences) …
Structural pattern matching-succinctly
Let T be a text of length n containing characters from an alphabet\Sigma, which is the union
of two disjoint sets:\Sigma_s containing static characters (s-characters) and\Sigma_p …
of two disjoint sets:\Sigma_s containing static characters (s-characters) and\Sigma_p …
Computing the Parameterized Burrows–Wheeler Transform Online
Parameterized strings are a generalization of strings in that their characters are drawn from
two different alphabets, where one is considered to be the alphabet of static characters and …
two different alphabets, where one is considered to be the alphabet of static characters and …