A word x that is absent from a word y is called minimal if all its proper factors occur in y.
Given a collection of k words y 1, y 2,..., yk over an alphabet Σ, we are asked to compute the …

Generalizations of plain strings have been proposed as a compact way to represent a
collection of nearly identical sequences or to express uncertainty at specific text positions by …

A word x that is absent from a word y is called minimal if all its proper factors occur in y.
Given a collection of k words y 1,…, yk over an alphabet Σ, we are asked to compute the set …

単純な文字列の一般化の一つは未決定文字列である. 未決定文字列の中に,
各位置に一つの文字が格納されているだけではなく, 複数の文字の選択肢が認められている …

With recent improvements in observational technology and developments of the Internet, we
can obtain large amounts of data such as meteorological data, web data, and biological …