>>>22288888
here is a single file implementation built from the scripts in that repo from when the author first published the code… slightly cleaner https://gist.github.com/foldxy/b782b16dd205a212d65f0d5a13cfa348
So you are saying that there the letters "I" and "O" in the sequence you are exploring? not just the base ACGT?
You could expand the rulesets for those additional characters and then introduce additional binary conversions in the script.
ie: the first rule would become (A) 0000, (C) 0001, (G) 0010, (T) 0011, (I)0100, (O)0101
This will also require additional rulesets to cover all possible combinations of ACGTIO