Abstract
We consider the compilation of complete (nonextensible) dictionaries of pairwise nonoverlapping codons containing the maximum possible number of such codons. This includes three subcases: (a) codons that do not allow overlapping by two letters, but allowing overlapping by one letter (e.g., ATC and CTG); (b) on the contrary, codons that do not allow only overlapping by one letter, but allow overlapping by two letters (e.g., ATC and TCG); (c) when there can be no overlap (as ATC and GTC). The last subcase is also an example of the nonoverlapping code that is used in coding theory and automata theory. Herein, we use graph theory and the SageMath computer algebra system as working tools.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
