One approach to find approximate matches is to use a strategy known as filtration. What is the basic logic of filtration? Filtration removes all of the areas of the sequences that do not overlap to...

Need in 5 minutes

Extracted text: One approach to find approximate matches is to use a strategy known as filtration. What is the basic logic of filtration? Filtration removes all of the areas of the sequences that do not overlap to reduce computational time. Filtration refers to the practice of drinking a cup of filtered coffee before trying to find approximate matches. The caffeine from the filtered coffee helps us remember the correct answer. A pair of sequences will share multiple k-mers that can be used to seed the alignment. Any pair of sequences withk mismatches will also have multiple exact matches that can be found with existing exact matching approaches (e.g., suffix trees). If you keep k small, this can generally be an efficient way to find approximate matches. Question 9 We often discuss the efficiency of algorithms using "Big O Notation" to express how computational time changes with increasing amount of data N. Please order the following notations from most efficient (1) to least efficient (3). O(n") O(n) O(n²)