Rosalind

Hello everyone! Today I am taking a look at Rosalinds GC problem and the various steps that it will take to complete it! The gist of the GC problem is quite easy, to calculate the GC percentage for certain strands of DNA and report which is largest. As some of Read more…

Hey guys and welcome to another one of my tutorials for Rosalind! Today we are looking at “Subs” or “Finding a Motif in DNA”. This is a very important theme in bioinformatics, searching dna for similarity. As many of you know one of the main ways that DNA is sequenced Read more…

Hello and welcome to my breakdown of Rosalind’s Counting Point Mutations (Hamm) problem. The problem states that you need to compare the two above lines and examine how many differences the seconds string has in relation to the first string, with that in mind let’s take a look at the Read more…

Jump to part 2Jump to part 3 Alright guys, here we go with Rosalind: FIB. When I first started doing rosalind, this was far and away the hardest problem I had to solve before I started my masters. I believe that the source of my confusion had to deal with Read more…

Alright guys, welcome to the tutorial/breakdown on IPRB or Introduction to Mendelian Inheritance. This one is a it tricky and involves some math which I will lay out for you guys as best as possible. Given Problem Given: Three positive integers k, m, and n, representing a population containing k+m+n Read more…

Welcome to my Rosalind tutorial on RNA The basic idea of RNA is to convert a given string of DNA into its RNA counterpart. This basically involves regurgitating the given string only replacing the “T” or Thymine with a “U” or Uramine counterpart. Given Problem Given: A DNA string having Read more…

Welcome to the first Rosalind Tutorial! [add more?] In DNA, the objective is to break apart a DNA string and count how many of each base pair the string contains. Input : a string of DNA Output : four numbers containing the output for ‘A’, ‘C’, ‘G’ and ‘T’ This Read more…