AbstractThe problem of classifying words on four letters into equivalence classes under the operations of conjugacy and reverse complementation is solved by using a surjective mapping to words on two letters of even length. This classification problem for words on four letters arises in the study of DNA sequences. For words on two letters the concept of a lexical word, which is based on a total order relation, allows one to assign a distinguished word to each conjugacy class. The mapping between words on four letters and those on two letters is used to assign a distinguished word to the conjugacy classes of words on four letters. The Möbius inversion formulas are basic to this enumeration problem
AbstractIn this paper we translate in terms of coding theory constraints that are used in designing ...
Coding theory has several applications in Genetics and Bioengineering. This thesis concentrates on a...
AbstractBased on a unified approach via the classical Burnside Lemma in combinatorics, we deal with ...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet (also...
In this paper we are interested in the study of the combinatorial aspects related to the extension o...
In this paper we are interested in the study of the combinatorial aspects related to the extension o...
Patterns, sequences of variables, have traditionally only been studied when morphic images of them a...
This seminal, multidisciplinary book shows how mathematics can be used to study the first principles...
Abstract: In this paper two variants of a combinatorial problem for the set Fnq of sequences of leng...
AbstractWhen representing DNA molecules as words, it is necessary to take into account the fact that...
Taking a DNA sequence, a word with letters/bases A, T, G and C, as the relation between the generato...
Biological macromolecules such as DNA, RNA, and proteins can be regarded as finite sequences of symb...
AbstractIn a previous paper, the authors used cyclic and extended cyclic constructions to obtain cod...
Many applications in molecular and systems biology exploit similarities between DNA and languages to...
We consider the problem of designing DNA codes, namely sets of equi-length words over the alphabet f...
AbstractIn this paper we translate in terms of coding theory constraints that are used in designing ...
Coding theory has several applications in Genetics and Bioengineering. This thesis concentrates on a...
AbstractBased on a unified approach via the classical Burnside Lemma in combinatorics, we deal with ...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet (also...
In this paper we are interested in the study of the combinatorial aspects related to the extension o...
In this paper we are interested in the study of the combinatorial aspects related to the extension o...
Patterns, sequences of variables, have traditionally only been studied when morphic images of them a...
This seminal, multidisciplinary book shows how mathematics can be used to study the first principles...
Abstract: In this paper two variants of a combinatorial problem for the set Fnq of sequences of leng...
AbstractWhen representing DNA molecules as words, it is necessary to take into account the fact that...
Taking a DNA sequence, a word with letters/bases A, T, G and C, as the relation between the generato...
Biological macromolecules such as DNA, RNA, and proteins can be regarded as finite sequences of symb...
AbstractIn a previous paper, the authors used cyclic and extended cyclic constructions to obtain cod...
Many applications in molecular and systems biology exploit similarities between DNA and languages to...
We consider the problem of designing DNA codes, namely sets of equi-length words over the alphabet f...
AbstractIn this paper we translate in terms of coding theory constraints that are used in designing ...
Coding theory has several applications in Genetics and Bioengineering. This thesis concentrates on a...
AbstractBased on a unified approach via the classical Burnside Lemma in combinatorics, we deal with ...