Algorithms and Complexity
1
Today
1. What is an algorithm?
2. How to describe and analyze
algorithms?
3. Big-Oh and relatives
2
What is an Algorithm?
Input
Algorithm
Output
An algorithm is a
An Introduction to Bioinformatics Algorithms
www.bioalgorithms.info
DNA Mapping and Brute Force Algorithms
An Introduction to Bioinformatics Algorithms
www.bioalgorithms.info
Outline
Re
CSC 530 Spring 2007
MockMidterm
1. Asymptotic growth. Example questions:
a) (6 points) Report the tightest big-Oh bounds for the following expressions:
n2 - n3 + n4
bound:
2
bound:
n + sin(n)
2 + 4
An Introduction to Bioinformatics Algorithms
www.bioalgorithms.info
Dynamic Programming:
Edit Distance
An Introduction to Bioinformatics Algorithms
www.bioalgorithms.info
An Introduction to Bioinforma
An Introduction to Bioinformatics Algorithms
www.bioalgorithms.info
DNAMappingandBrute
ForceAlgorithms
An Introduction to Bioinformatics Algorithms
www.bioalgorithms.info
Outline
Restriction Enzymes
D
Algorithms and Complexity
1
Today
1. What is an algorithm?
2. How to describe and analyze
algorithms?
3. Big-Oh and relatives
2
The Sorting Problem
Input: An array A of n integers
[ a1, , an ].
Output