Question: With the Overlap, Layout, Consensus approach to genome assembly, if there are n reads input into a nave algorithm, how many comparisons must be made
With the Overlap, Layout, Consensus approach to genome assembly, if there are n reads input into a nave algorithm, how many comparisons must be made to find all the potential overlaps among read pairs? Express your answer in terms of n.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
