Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Double bind wikipedia , lookup
A New Kind of Science wikipedia , lookup
Lateral computing wikipedia , lookup
Genetic algorithm wikipedia , lookup
Knapsack problem wikipedia , lookup
Theoretical computer science wikipedia , lookup
Computational electromagnetics wikipedia , lookup
Computational linguistics wikipedia , lookup
Travelling salesman problem wikipedia , lookup
Natural computing wikipedia , lookup
PRELIMINARIES–COMPUTATIONAL PROBLEM Given a set of real numbers, output a sequence, (l1 , … , li , … , ln), where li ≤ li+1 for i = 1 … n-1 . Naive Algorithm For index i=1 .. n-1, if li > li+1 then swap the two numbers. Repeat until a complete pass for i = 1 … n-1 is made without making any swaps. Any better algorithms? POINT OF THE EXERCISE Computational Problem is abstract Decouples the application entirely from solving the problem. Helps communicate the problem in a universal and understandable language another algorithmist may find a solution (either by coming up with one, or noticing the problem is similar to a formulation used in another discipline) http://www.sorting-algorithms.com/ PROTEIN COMPLEX FORMATION Motivation Experiments have shown numerous proteins that bind or aggregate together. Identify protein complexes? Problem Formulation Inputs? Objectives? Find the protein with the most partners and form an initial complex. Keep adding proteins if they bind to all members of the group. Output? Get a list of proteins and the partners they bind to. The collection of proteins in the complex. Plausible Algorithm? NOT POSSIBLE!?!?! THE COMPUTATIONAL BIOLOGY PROCESS Biological Motivation Computational Problem Formulation Tractability? Adequate? YES YES Proceed to Design an efficient ALGORITHM COMPUTATIONAL PROBLEM FORMULATION Given a graph G(V,E), output all maximal cliques of size at least k. A clique C is a set of vertices that form a complete subgraph. Maximal clique C’ is a clique where the addition of any vertex v in V\C’ does not form a clique. Problems Tractability? O(3n/3) Adequate? Choosing parameter k? Every clique in a Protein-Protein Interaction network is not a protein complex. Two proteins do not bind, but may still form a complex. Wang et al. 2010 – Recent Paper on Cluster/Module/Complex Identification in PPI