Algorithms on Sequences
Algorithms on Sequences
Algorithms on Sequences
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Alignment of two sequences<br />
• Matching of 2 subsequences<br />
example : TACGT-AAT<br />
TATGTGAAT<br />
• 2 elementary operati<strong>on</strong>s<br />
– substituti<strong>on</strong><br />
– inserti<strong>on</strong> / deleti<strong>on</strong> : gap<br />
Score of an alignment<br />
• Necessary to «compare» 2 alignments<br />
• Score evaluated as a functi<strong>on</strong> of costs of<br />
elementary operati<strong>on</strong>s<br />
– substituti<strong>on</strong> cost<br />
• DNA : match : +M<br />
mismatch : -N<br />
• Protein : substituti<strong>on</strong> matrix<br />
– inserti<strong>on</strong>/deleti<strong>on</strong> (indel) cost
Change language