Compatibility and Conjugacy on Partial Arrays
Authors:
Open Access
- 28 September 2016
- journal article
- research article
- Published by Wiley in Computational and Mathematical Methods in Medicine
- Vol. 2016, 1-5
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 called-compability. It also studies-conjugacy of partial arrays.
Keywords
This publication has 9 references indexed in Scilit:
- Collage of Hexagonal ArraysLecture Notes in Computer Science, 2008
- Equations on partial wordsRAIRO - Theoretical Informatics and Applications, 2007
- Conjugacy on partial wordsTheoretical Computer Science, 2002
- Partial words and a theorem of Fine and Wilf revisitedTheoretical Computer Science, 2002
- Special Factors in Biological StringsJournal of Theoretical Biology, 2000
- On the combinatorics of finite wordsTheoretical Computer Science, 1999
- Partial words and a theorem of Fine and WilfTheoretical Computer Science, 1999
- Combinatorics on Words1997
- A possible code in the genetic codeLecture Notes in Computer Science, 1995