note05 - Outline 1 Bioinformatics and Computational Biology...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Outline 1 Bioinformatics and Computational Biology 2 Local Similarity Problem c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 1 / 30 Bioinformatics and Computational Biology LCS is closely related to a group of central problems in Bioinformatics and Computational Biology c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 30 Bioinformatics and Computational Biology LCS is closely related to a group of central problems in Bioinformatics and Computational Biology A DNA string is a string over Σ = { A , T , C , G } . c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 30 Bioinformatics and Computational Biology LCS is closely related to a group of central problems in Bioinformatics and Computational Biology A DNA string is a string over Σ = { A , T , C , G } . The human DNA geno consists of DNA strings of total length about 3 · 10 9 letters. c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 30 Bioinformatics and Computational Biology LCS is closely related to a group of central problems in Bioinformatics and Computational Biology A DNA string is a string over Σ = { A , T , C , G } . The human DNA geno consists of DNA strings of total length about 3 · 10 9 letters. A substring is a continuous section of the string. (In contrast, a subsequence needs not be continuous. ) c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 30 Bioinformatics and Computational Biology LCS is closely related to a group of central problems in Bioinformatics and Computational Biology A DNA string is a string over Σ = { A , T , C , G } . The human DNA geno consists of DNA strings of total length about 3 · 10 9 letters. A substring is a continuous section of the string. (In contrast, a subsequence needs not be continuous. ) A gene is a substring in DNA string that encodes a protein . c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 30 Bioinformatics and Computational Biology LCS is closely related to a group of central problems in Bioinformatics and Computational Biology A DNA string is a string over Σ = { A , T , C , G } . The human DNA geno consists of DNA strings of total length about 3 · 10 9 letters. A substring is a continuous section of the string. (In contrast, a subsequence needs not be continuous. ) A gene is a substring in DNA string that encodes a protein . The lengths of typical genes range from 500 - 10000 letters. c Xin He (University at Buffalo) CSE 431/531 Algorithm Analysis and Design 2 / 30 Bioinformatics and Computational Biology LCS is closely related to a group of central problems in Bioinformatics and Computational Biology A DNA string is a string over Σ = { A , T , C , G } ....
View Full Document

{[ snackBarMessage ]}

Page1 / 115

note05 - Outline 1 Bioinformatics and Computational Biology...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online