Bioinformatics databases structures and Algorithms

Given the sequence TTACGCGACAGATA find all kmers of size 4. Create a table that displays the counts for each unique kmer and it’s position(s).

What is an NP-Complete problem and how do we solve one?

Write the line of code that defines the variable sequence as AATCGA in python.

Q3 (20 pts): Using pseudocode, describe an algorithm that searches for all instances of “ATC” in a given sequence. What do you think the BigO will be for this algorithm and why?

Q4 (5 pts): What is a CIGAR string? How is it generated, and where will you find it?

Q5 (10 pts): What are the required fields for a VCF file?

What is BigO? What factors impact it? Provide an example.

Describe how a hash function works, using both descriptive text and a diagram with examples.