Our Java program is meant to find the mutated sections of a gene.

Basically, the program loads the provided gene sequence into its database and begins to seek out start and stop codons. Between starts and stops, Java counts the number of base pairs. If the number is more or less than 13,973 base pairs, the gene is printed out on the screen to show its mutation. Java also compares the gene side by side with the correct sequence, and if there are any alterations, that gene is printed out, as well. If the gene is correct, the program shows that it is correct and does not print out the sequence.