Bioinformatics/Sequence mutation

Given a string of characters A, C, G, and T representing a DNA sequence write a routine to mutate the sequence, (string) by:

1. Choosing a random base position in the sequence.
2. Mutate the sequence by doing one of either:
   1. Swap the base at that position by changing it to one of A, C, G, or T. (which has a chance of swapping the base for the same base)
   2. Delete the chosen base at the position.
   3. Insert another base randomly chosen from A,C, G, or T into the sequence at that position.
3. Randomly generate a test DNA sequence of at least 200 bases
4. "Pretty print" the sequence and a count of its size, and the count of each base in the sequence
5. Mutate the sequence ten times.
6. "Pretty print" the sequence after all mutations, and a count of its size, and the count of each base in the sequence.

Bioinformatics/Sequence mutation is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.

Task

Extra credit

• Give more information on the individual mutations applied.
• Allow mutations to be weighted and/or chosen.

Python

In function seq_mutate argument kinds selects between the three kinds of mutation. The characters I, D, and S are chosen from the string to give the kind of mutation to perform, so the more of that character, the more of that type of mutation performed.
Similarly parameter choice is chosen from to give the base for substitution or insertion - the more any base appears, the more likely it is to be chosen in any insertion/substitution.

<lang python>import random from collections import Counter

def basecount(dna):

   return sorted(Counter(dna).items())

def seq_split(dna, n=50):

   return [dna[i: i+n] for i in range(0, len(dna), n)]

def seq_pp(dna, n=50):

   for i, part in enumerate(seq_split(dna, n)):
       print(f"{i*n:>5}: {part}")
   print("\n  BASECOUNT:")
   tot = 0
   for base, count in basecount(dna):
       print(f"    {base:>3}: {count}")
       tot += count
   base, count = 'TOT', tot
   print(f"    {base:>3}= {count}")

def seq_mutate(dna, count=1, kinds="IDSSSS", choice="ATCG" ):

   mutation = []
   k2txt = dict(I='Insert', D='Delete', S='Substitute')
   for _ in range(count):
       kind = random.choice(kinds)
       index = random.randint(0, len(dna))
       if kind == 'I':    # Insert
           dna = dna[:index] + random.choice(choice) + dna[index:]
       elif kind == 'D' and dna:  # Delete
           dna = dna[:index] + dna[index+1:]
       elif kind == 'S' and dna:  # Substitute
           dna = dna[:index] + random.choice(choice) + dna[index+1:]
       mutation.append((k2txt[kind], index))
   return dna, mutation

if __name__ == '__main__':

   length = 250
   print("SEQUENCE:")
   sequence = .join(random.choices('ACGT', weights=(1, 0.8, .9, 1.1), k=length))
   seq_pp(sequence)
   print("\n\nMUTATIONS:")
   mseq, m = seq_mutate(sequence, 10)
   for kind, index in m:
       print(f" {kind:>10} @{index}")
   print()
   seq_pp(mseq)</lang>

Output:

SEQUENCE:
    0: GGAAGATTAGGTCACGGGCCTCATCTTGTGCGAGATAAATAATAACACTC
   50: AGCGATCATTAGAATGTATATTGTACGGGCATGTTTATCTACCATAGGTC
  100: CTGTCAAAAGATGGCTAGCTGCAATTTTTTCTTCTAGATCCCGATTACTG
  150: CGGTATTTTTGTATAACGTGCTAAACGGTGTGTTTTCAGGTCGGCCTGCT
  200: AATCTAACGCCAGTGGACTTGGGATGGACGCCCAACAACTGAGAGCGCGG

  BASECOUNT:
      A: 64
      C: 51
      G: 62
      T: 73
    TOT= 250


MUTATIONS:
 Substitute @138
 Substitute @72
     Insert @103
     Insert @129
     Insert @124
     Delete @52
     Delete @202
 Substitute @200
     Insert @158
     Delete @32

    0: GGAAGATTAGGTCACGGGCCTCATCTTGTGCGGATAAATAATAACACTCA
   50: GGATCATTAGAATGTATATTATACGGGCATGTTTATCTACCATAGGTCCT
  100: GCTCAAAAGATGGCTAGCTGCAGATTTTGTTCTTCTAGAGCCCGATTACT
  150: GCGGTATGTTTTGTATAACGTGCTAAACGGTGTGTTTTCAGGTCGGCCTG
  200: CTATCTAACGCCAGTGGACTTGGGATGGACGCCCAACAACTGAGAGCGCG
  250: G

  BASECOUNT:
      A: 63
      C: 51
      G: 65
      T: 72
    TOT= 251