title: Compatibility and Conjugacy on Partial Arrays.
abstract: 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 calledk-compability. It also studiesk-conjugacy of partial arrays.
authors: Department of Science and Humanity, Sathyabama University, Chennai, India.
authors: S
authors: 0000-0002-3635-5941
authors: S
authors: Vijayachitra
authors: Department of Mathematics, St. Joseph's College of Engineering, Chennai, India.
authors: K
authors: K
authors: Sasikala
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D003198:Computer Simulation; D004247:DNA / Q000032:analysis*; D008957:Models, Genetic; D015233:Models, Statistical; D015203:Reproducibility of Results
chemical_list: D004247:DNA