Data Structures & Algorithms

Q1 (10 pts):  Define kmer.  Provide 3 separate examples.

Q2 (15 pts):  Define a heuristic algorithm.  When is it appropriate to use one?

Q3 (15 pts):  If you have 25 taxa, how many possible rooted trees can you construct?

Q4 (20 pts):  Given the sequence AATTACAGGCGACAGATA find all kmers of size 3.  Create a table that lists each kmer along with its count (number of times found) and position(s).

Q5 (20 pts):  Describe how a hash function works, using both descriptive text and a diagram.

Q6 (20 pts):  Describe how BLAST uses hash tables to speed up sequence searching.

Need Help with Your Assignment? Let us Help you

Place Your Order

We guarantee you the following if you order your paper with us

High Quality Papers

All papers are written by ENL (US, UK, AUSTRALIA) writers with vast experience in the field. We perform a quality assessment on all orders before submitting them.

Timely Delivery

Do you have an urgent order?  We have more than enough writers who will ensure that your order is delivered on time. 

100% Original

We provide plagiarism reports for all our custom written papers. All papers are written from scratch.

24/7 Customer Support

Contact us anytime, any day, via any means if you need any help. You can use the Live Chat, email, or our provided phone number anytime.

Confidential and Secure

We will not disclose the nature of our services or any information you provide to a third party.

Stressed? We got you covered

Money-Back Guarantee

Get your money back if your paper is not delivered on time or if your instructions are not followed.

We Guarantee the Best Grades

Get a Professional Answer