Compatibility and Conjugacy on Partial Arrays

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.

[1]  Francine Blanchet-Sadri,et al.  Partial words and a theorem of Fine and Wilf revisited , 2002, Theor. Comput. Sci..

[2]  Jean Berstel,et al.  Partial Words and a Theorem of Fine and Wilf , 1999, Theor. Comput. Sci..

[3]  Didier Arquès,et al.  A Prossible Code in the Genetic Code , 1995, STACS.

[4]  Francine Blanchet-Sadri,et al.  Conjugacy on partial words , 2002, Theor. Comput. Sci..

[5]  Aldo de Luca,et al.  On the Combinatorics of Finite Words , 1999, Theor. Comput. Sci..

[6]  Francine Blanchet-Sadri,et al.  Equations on partial words , 2009, RAIRO Theor. Informatics Appl..

[7]  Francine Blanchet-Sadri,et al.  Equations on partial words , 2006, RAIRO Theor. Informatics Appl..

[8]  Tero Harju,et al.  Combinatorics on Words , 2004 .

[9]  M. Lothaire,et al.  Combinatorics on words: Frontmatter , 1997 .

[10]  D. Gnanaraj Thomas,et al.  Collage of Hexagonal Arrays , 2008, ISVC.

[11]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[12]  A Colosimo,et al.  Special factors in biological strings. , 2000, Journal of theoretical biology.