Notes on Fasta Algorithms - Bioinformatics | BIOL 7023, Study notes of Biology

Download Notes on Fasta Algorithms - Bioinformatics | BIOL 7023 and more Study notes Biology in PDF only on Docsity! “t= Sequence A —— ~~ Sequence A —— EASTA Algorithm (a) Sequence 8B —> S NN * sN oN \S Pb. oe eoN Pe NS L \ Find runs of identities (e) —— Sequence 8B —> \ | Apply “joining threshold" to eliminate segments that are unlikely to be part of the alignment that includes highest scoring segmeni. ~t— Sequence A — ~t— Sequence A ——— (b) —— Sequence B —> Re-score using PAM matrix Keep top scoring segments. (d) Sequence 8 —> Use dynamic programming to optimise the alignment in a narrow band that encompasses the top scoring segments. x ~~ end loop of “—~ interior loop of size (3,2) Figure 13.3: Components of a hairpin  Pe >0 «<4 > oe ety av 800 8 8 o>? av fu a c ange a Ac GA ue co oY aA aU 950 750  Figure 13.2: The 17 secondary structures for (1, 6]. Theorem 13.2 Asn — =, , 1547/5 3/2 34.5 S(n) ~ on 7 :