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 step-by-step procedure for solving a problem in a
An Introduction to Bioinformatics Algorithms
www.bioalgorithms.info
DNA Mapping and Brute Force Algorithms
An Introduction to Bioinformatics Algorithms
www.bioalgorithms.info
Outline
Restriction Enzymes Gel Electrophoresis Partial Dige
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 + + 2n
bound:
b) Please order the following functions
An Introduction to Bioinformatics Algorithms
www.bioalgorithms.info
Dynamic Programming:
Edit Distance
An Introduction to Bioinformatics Algorithms
www.bioalgorithms.info
An Introduction to Bioinformatics Algorithms
www.bioalgorithms.info
Cystic Fibrosis
An Introduction to Bioinformatics Algorithms
www.bioalgorithms.info
DNAMappingandBrute
ForceAlgorithms
An Introduction to Bioinformatics Algorithms
www.bioalgorithms.info
Outline
Restriction Enzymes
Double Digest Problem
Partial Digest Problem
Brute Force
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: rearranged array A with elements
in non-decreasing or