Compatibility and conjugacy on partial arrays
From MaRDI portal
Summary: 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.
Recommendations
- scientific article; zbMATH DE number 798650
- scientific article; zbMATH DE number 5206701
- Compatible elements in partly ordered groups
- Compatibility in D-posets
- Compatibility relations and complete cover of finite sets
- On arrays with some combinatorial structure
- Compatibility of elements in Jordan algebras
- scientific article; zbMATH DE number 3900993
- Extensions and congruences of partial lattices
- scientific article; zbMATH DE number 4034013
Cites work
- A possible code in the genetic code
- Conjugacy on partial words.
- Equations on partial words
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- On the combinatorics of finite words
- Partial words and a theorem of Fine and Wilf
- Partial words and a theorem of Fine and Wilf revisited
This page was built for publication: Compatibility and conjugacy on partial arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013016)
