280 likes | 445 Views
Nuclear M a gnetic Resonance Structure Based Assignment. Mehmet Çağrı Çalpur Gizem Çavuşlar Mehmet Serkan Apaydın Bülent Çatay. Agenda. Protein Structure Determination Nuclear Magnetic Resonance Spectroscopy Problem Definition and Formulation Metaheuristics Tabu Search
E N D
Nuclear Magnetic Resonance Structure Based Assignment MehmetÇağrı Çalpur Gizem Çavuşlar Mehmet Serkan Apaydın Bülent Çatay
Agenda • Protein Structure Determination • Nuclear Magnetic Resonance Spectroscopy • Problem Definition and Formulation • Metaheuristics • Tabu Search • Ant Colony Optimization • Conclusion and Future Work
Protein • Made of amino acids • Functions • Catalyzing biochemical reactions (enzymes) • Structural and mechanical roles (bones, muscles) • Immune system responses (antibodies) • Material transportation (hemoglobin) • Protein structure determination Function definition • Drug design • Enzyme design
Nuclear Magnetic Resonance • Two main approaches for structure determination • XRC – 85% of solved structures • NMR - 15% of solved structures • Nuclear magnetic resonance is a phenomenon which occurs when the nuclei of certain atoms are immersed in a static magnetic field and exposed to a second oscillating magnetic field
Problem Definition • The assignment problem Peaks Amino Acids xpeak1,aa1=0 Distance relations xpeak2,aa3=1 NOE relations
Binary Integer Programming • Proposed by Apaydin et.al. (2009)
Solution Methods • Exact solution method • Heuristic Methods • Ant Colony Optimization • Tabu Search
Why Heuristics? • Solutions for large problems • Multiple solutions • Optimal may not be the most accurate • Common assignments in best k solutions
Tabu Search • Solution • Neighbor • Evaluation • Tabu Check • Move • Tabu Update *nuweb2.neu.edu
Quadratic Assignment Problem Formulation • BIP • QAP formulation
Tabu Search Algorithm • Solution
Tabu Search Algorithm • Solution • Neighbor generation • Swap P1 and P3
Tabu Search Algorithm • Solution • Neighbor generation • Swap P1 and P3
Tabu Search Algorithm • Solution • Neighbor generation • Swap P1 and P3
Tabu Search Algorithm • Solution • Neighbor generation • Swap P1 and P3
Tabu Search Algorithm • Solution • Neighbor generation • Swap P1 and P3 • Evaluation Objective function of QAP formulation
Tabu Search Algorithm Tabu Structure 1 Tabu Structure 2 P1 P2 P3 P4 A1 A2 A3 A4 P1 P2 P3 P4 P1 P2 P3 P4 Iteration number until the attribute stays tabu
Tabu Search Algorithm Tabu Structure 1 P1 P2 P3 P4 P1 P2 P3 P4 • Randomly picked from [smin, smax]
Tabu Search Algorithm • Diversification • Probabilistic • Long term memory
Ant Colony Optimization(ACO) • Swarm Intelligence • Behavioral, decentralized decision making • Robotics • Optimization • Proposed by Marco Dorigo in 1992.
The Algorithm • Main components • InitializeData • ConstructSolutions • Ant System DecisionRule • Backtrack • Pheromone Update • GlobalBest Update
The Algorithm Procedure NVR-EAS InitializeData While (not terminated) do ConstructSolutions Update Tour Best Assignment Update Pheromone Trails End-while End-Procedure
Assignment Selection • Probability of assigning peak i to aa j Peak i Peak i+1 Peak i+2 aa m aa n aa k
Backtracking • Selected assignment become unavailable • Selection is done from the updated possibility list Peak i Peak i+1 Peak i+2 aa m aa n aa k
Conclusion and Future Work • Exact solution methods • Metaheuristic implementation • Tabu search • Changing diversification mechanism • Implementing new operator • Ant colony • Extensive parameter testing • Adapting new scoring functions • Scoring matrix generated by machine learning performs better than NVR-BIP data