Compatibility and Conjugacy on Partial Arrays

Abstract EN

Research in combinatorics on words goes back a century.

Berstel and Boasson introduced the partial words in the context of gene comparison.

Alignment of two genes can be viewed as a construction of two partial words that are said to be compatible.

In this paper, we examine to which extent the fundamental properties of partial words such as compatbility and conjugacy remain true for partial arrays.

This paper studies a relaxation of the compatibility relation called k -compability.

It also studies k -conjugacy of partial arrays.