Timeline for How can I calculate the silent mutation for each position in codon?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 11, 2017 at 11:48 | comment | added | Devon Ryan | Patients (and scientists in my experience) tend to over interpret what a "mutation" is. Things like synonymous polymorphisms were less likely to be conveyed to non-professionals, but yes the "silent" terminology is also misleading, though it's not going to make some random patient think they're going to be the next Magneto. | |
| Oct 11, 2017 at 11:43 | comment | added | Chris_Rands | Curious why you think 'mutation' is a loaded term? To me, 'silent' is the loaded part, since synonymous changes may have fitness effects due to codon usage bias or regulatory element overlapping coding sequences | |
| Oct 9, 2017 at 22:01 | comment | added | terdon♦ | @snnlaynnkrdsm try and implement this. Once you have something written down, if you're stuck with a specific aspect of your program, you can ask again here. But first try it out! We won't just write the program for you, but we're happy to help with specific problems you face. | |
| Oct 9, 2017 at 19:41 | comment | added | Devon Ryan | You can efficiently get that from the method I described. | |
| Oct 9, 2017 at 19:01 | comment | added | Mert Metin | but he wants me to find number of silent mutations for each position of codon. Lets say codon is GCT and wants me to count the number of silent mutation for the codons and for each position. | |
| Oct 9, 2017 at 18:47 | history | answered | Devon Ryan | CC BY-SA 3.0 |