The directed acyclic word graph (DAWG) of a string y of length n is the smallest (partial) DFA
which recognizes all suffixes of y with only O (n) nodes and edges. In this paper, we show …

Sequence comparison is a prerequisite to virtually all comparative genomic analyses. It is
often realised by sequence alignment techniques, which are computationally expensive …

An absent word of a word y is a word that does not occur in y. It is then called minimal if all its
proper factors occur in y. In fact, minimal absent words (MAWs) provide useful information …

String matching is one of the oldest algorithmic techniques, yet still one of the most
pervasive in computer science. The past 20 years have seen technological leaps in …

Sequence comparison is a prerequisite to virtually all comparative genomic analyses. It is
often realized by sequence alignment techniques, which are computationally expensive …

An absent (or forbidden) word of a word y is a word that does not occur in y. It is then called
minimal if all its proper factors occur in y. There exist linear-time and linear-space algorithms …

Minimal forbidden factors are a useful tool for investigating properties of words and
languages. Two factorial languages are distinct if and only if they have different …

The palindromic tree (aka eertree) for a string S of length n is a tree-like data structure that
represents the set of all distinct palindromic substrings of S, using O (n) space [Rubinchik …

This paper gives an array-based practical encoder for the lossless data compression
algorithm known as Compression by Substring Enumeration (CSE). The encoder makes use …

A generalization of compression via substring enumeration (CSE) for k-th order Markov
sources with a finite alphabet is proposed, and an upper bound of the codeword length of …