Please Help! Please compleate the following C program and provide steps on what
ID: 3762249 • Letter: P
Question
Please Help! Please compleate the following C program and provide steps on what each line is doing. Thank you and you're the best. Have a good day.
For this exercise, you will develop a program that processes a DNA sequence from a file and, given a subequence s, searches the DNA sequence and counts the number of times s appears. As an example, consider the following sequence:
GGAAGT AGCAGGCCGCAT GCT T GGAGGT AAAGT T CAT GGT T CCCT GGCCC
If we were to search for the subsequence GT A, it appears twice. You will write a program (place your source in a file named dnaSearch.c) that takes, as command line inputs, an input file name and a valid DNA (sub)sequence. That is it should be callable from the command line as:
˜>./a.out dna.txt GTA
which will open the file dna.txt which contains a DNA sequence (with some possible whitespace which should be ignored). The program should search the DNA sequence and compute the number of times the subsequence appears. Print the results to the standard output.
For example: GTA appears 2 times.
Explanation / Answer
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
void input_sequence(int length,char input[]);
void search(char C[],char DNA[],int length);
int main(void) {
//Given array
char DNA[] = {'A', 'G', 'C', 'G', 'G', 'G', 'A', 'C', 'C', 'G', 'T', 'C',
'C', 'C', 'G', 'A', 'C', 'A', 'T', 'T', 'G', 'A', 'T', 'G',
'A', 'A', 'G', 'G', 'G', 'T', 'C', 'A', 'T', 'A', 'G', 'A',
'C', 'C', 'C', 'A', 'A', 'T', 'A', 'C', 'G', 'C', 'C', 'A',
'C', 'C', 'A', 'C', 'C', 'C', 'C', 'A', 'A', 'G', 'T', 'T',
'T', 'T', 'C', 'C', 'T', 'G', 'T', 'G', 'T', 'C', 'T', 'T',
'C', 'C', 'A', 'T', 'T', 'G', 'A', 'G', 'T', 'A', 'G', 'A',
'T', 'T', 'G', 'A', 'C', 'A', 'C', 'T', 'C', 'C', 'C', 'A',
'G', 'A', 'T', 'G', ''};
int length,i=0,k;
/*Program should repeatedly ask the user for two things: the length of a search sequence,
and the search sequence itself*/
/*The program should terminate when the length of the input sequence is zero or less*/
do{
printf("Enter length of DNA sequence to match: ");
scanf("%d",&length);
Search sequence array
char input[length];
//input sequence length has to be >0
if(length>0){
input_sequence(length,input[]);
/*The elements of the search sequence may take on one of five characters: A,G,T,C and *. The
meaning of the ‘*’ character is that it matches all four nucleotides: A,G,T and C.*/
for(i=0; i<length; i++){
k=0;
if(input[i]!='A'&&input[i]!='G'&&input[i]!='T'&&input[i]!='C'&&input[i]!='*'){
printf("Erroneous character input ’%c’ exiting ",input[i]);
k=1;
}
if(k==1)
break;
}
if(k==0){
search(input,DNA,length);
}
k=0;
}
}
while(length>0);
printf("Goodbye");
return (EXIT_SUCCESS);
}
//Function to search for input sequence in the given array
void search(char C[],char DNA[],int length){
int numFound = 0,i,foundIndex;
bool found = false;
for(i=0;i<length && !found;i++) {
int n=0;
char temp=C[i];
if (temp==DNA[i]) {
numFound++;
if (numFound == length) {
found = true;
foundIndex = i - (length-1);
}
}
else numFound = 0;
}
if (found)
printf("Match of search sequence found at element %d ",foundIndex);
}
void input_sequence(int length,char input[]){
int i;
printf("Enter %d characters (one of AGTC*) as a search sequence: ",length);
for(i=0; i<length; i++){
scanf(" %c", &input[i]);
}
}