3 ms·
Another minor correction: Each base pair is one of 4 things, so 2 bits of information. Each base is half of a base pair so can really only claim 1 bit of inform
by gpm 8y ago
Another minor correction: Each base pair is one of 4 things, so 2 bits of information. Each base is half of a base pair so can really only claim 1 bit of information.
Of course even when you said base you did the math with # of base pairs, so it doesn't really matter.
- hn_throwaway_99 8y agoNo, that is not correct. While each base is half of a base pair, each pair is NOT reversible. At each position along one strand you have 4 options, so each base encodes 2 bits. Even though A always pairs with T and G with C, which strand each base is on matters, so in other words if you have pair "A-T" followed by "G-C" that is very different from "T-A" followed by "C-G".
- gpm 8y agoYou have a problem with your counting. Each location can be in one of four possible states: T-A A-T G-C C-G That location, using 2 base's, encodes 4 possible values, i.e. 2 bits. I.e. 1 bit per base.