101 6,8-Mar
101 6,8-Mar. Discussion of algorithms for exact matches Hashing, Binary trees a,c,g,t = 00, 01, 10, 11 log2(N)= 34 N=target sequence length e.g. 3E9 m=total of query lengths, E9 people * 30E9bp(5X) O(mN) vs O(mlogN) = E29 vs E21. 101 6-Mar To do list draft. 1. Mike: Bioweather HapMap
128 views • 2 slides