Background A fundamental assumption of all widely-used multiple sequence alignment
techniques is that the left-and right-most positions of the input sequences are relevant to the …

The edit distance is a way of quantifying how similar two strings are to one another by
counting the minimum number of character insertions, deletions, and substitutions required …

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 …

The directed acyclic word graph (DAWG) of a string y is the smallest (partial) DFA which
recognizes all suffixes of y and has only O (n) nodes and edges. We present the first O (n) …

Background The deviation of the observed frequency of a word w from its expected
frequency in a given sequence x is used to determine whether or not the word is avoided …

We define three retrieval tasks requiring efficient search of the musical content of a collection
of~ 32k page images of 16th-century music to find: duplicates; pages with the same musical …

Based on the World Health Organization data obtained in mid-April 2021, Coronavirus or
Severe Acute Respiratory Syndrome Coronavirus 2 (SARS-CoV-2) has already infected …

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 …

Enumerating characteristic substrings (eg, maximal repeats, minimal unique substrings, and
minimal absent words) in a given string has been an important research topic because there …