1 citations · 1 across the 4 of their papers we have counts for
7 papers
A Simple Reduction for Full-Permuted Pattern Matching Problems on Multi-Track Strings
Carl Barton, Ewan Birney, Tomas Fitzgerald
In this paper we study a variant of string pattern matching which deals with tuples of strings known as \textit{multi-track strings}. Multi-track strings are a generalisation of st…
Indexing Weighted Sequences: Neat and Efficient
Carl Barton, Tomasz Kociumaka, Chang Liu +2
In a \emph{weighted sequence}, for every position of the sequence and every letter of the alphabet a probability of occurrence of this letter at this position is specified. Weighte…
Efficient Index for Weighted Sequences
Carl Barton, Tomasz Kociumaka, Solon P. Pissis +1
The problem of finding factors of a text string which are identical or similar to a given pattern string is a central problem in computer science. A generalised version of this pro…
Fast Average-Case Pattern Matching on Weighted Sequences
Carl Barton, Chang Liu, Solon P. Pissis
A weighted string over an alphabet of size is a string in which a set of letters may occur at each position with respective occurrence probabilities. Weighted strings, also kno…
On the Average-case Complexity of Pattern Matching with Wildcards
Carl Barton
Pattern matching with wildcards is the problem of finding all factors of a text of length that match a pattern of length , where wildcards (characters that match eve…
Linear-time Computation of Minimal Absent Words Using Suffix Array
Carl Barton, Alice Heliou, Laurent Mouchard +1
An absent word of a word y of length n is a word that does not occur in y. It is a minimal absent word if all its proper factors occur in y. Minimal absent words have been computed…
Average-Case Optimal Approximate Circular String Matching
Carl Barton, Costas S. Iliopoulos, Solon P. Pissis
Approximate string matching is the problem of finding all factors of a text t of length n that are at a distance at most k from a pattern x of length m. Approximate circular string…