Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Suppose a given string sequence AGCGTNCGTNGTACGTNACGTNAACGTN the string consists of only one line and all uppercase alphabets A,G,T,C,N Here A,G,T,C are considered valid characters and

Suppose a given string sequence "AGCGTNCGTNGTACGTNACGTNAACGTN"

the string consists of only one line and all uppercase alphabets A,G,T,C,N

Here A,G,T,C are considered valid characters and N is like a break point.

I have to make k-mer sequences. (k >= 2 && k <=10).

suppose the sequence "ACGNACGCTN"

suppose k = 3

I have to output the unique kmer formed in the sequence and the number of times it appears in the sequence.

like

ACG 2

CGC 1

GCT 1

If you encounter an N in the sequence, you simply check for the kmer from position (N+1) and so on.

I have to implement this using arrays or vectors.

The string sequence file can be over 100mb in size so please keep in check with algorithm runtimes (like dont use any nested for loops)

No hashmaps or any use of dictionaries like maps.

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database In Depth Relational Theory For Practitioners

Authors: C.J. Date

1st Edition

0596100124, 978-0596100124

More Books

Students also viewed these Databases questions