Cost Partitioning Techniques for Multiple Sequence Alignment. Mirko Riesterer,
|
|
- Albert Gray
- 5 years ago
- Views:
Transcription
1 Cost Partitioning Techniques for Multiple Sequence Alignment Mirko Riesterer,
2 Agenda. 1 Introduction 2 Formal Definition 3 Solving MSA 4 Combining Multiple Pattern Databases 5 Cost Partitioning 6 Experiments 7 Conclusion Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 2
3 Introduction Multiple Sequence Alignment Biological sequences mutate during evolution Insertion, deletion, substitution Some mutations are more likely (A G / C T) Observe phylogenetic relationships Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 3
4 Introduction Multiple Sequence Alignment Insert gaps within sequences Maximize correspondence between letters in columns Sequences ACGTG ACTAG CGTAG Alignment ACGT-G AC-TAG -CGTAG Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 4
5 Introduction Judging the alignment quality Count matches/mismatches Score matrix Point accepted mutation (PAM n ) matrix (Dayhoff et al., 1978) Blocks substitution matrix (BLOSUM) (Henikoff and Henikoff, 1992) Score matrix: A C T G A C T G Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 5
6 Agenda. 1 Introduction 2 Formal Definition 3 Solving MSA 4 Combining Multiple Pattern Databases 5 Cost Partitioning 6 Experiments 7 Conclusion Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 6
7 Formal Definition Family of sequences S = {s 1,, s n } over alphabet Σ and Σ = Σ Alignment Matrix A n m = a ij, where a ij Σ a i without is exactly s i No column contains only Score matrix: A C T G A C T G Sequences: ACT CTG Alignment A: A C T C T G C A = =7 Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 7
8 Formal Definition Score matrix can be viewed as function sub Σ Σ N Given alignment A and score matrix sub. Pair score m C A ij = k=1 sub(a ik, a jk ) Sum of pairs score C A = 1 i<j n A C ij Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 8
9 Formal Definition Shortest Path Problem Directed acyclic graph G = V, E V = x 1,, x n x i = 0,, l i } E = e 0,1 n v, v + e v, v + e V, e 0}. Figure: 2D graph alignment Figure: 3D edge structure ( Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 9
10 Agenda. 1 Introduction 2 Formal Definition 3 Solving MSA 4 Combining Multiple Pattern Databases 5 Cost Partitioning 6 Experiments 7 Conclusion Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 10
11 Solving MSA Needleman-Wunsch algorithm Dynamic programming approach Generates zero-based index table with optimal scores Dim n, lengths l: Complexity O l n Figure 2: Needleman-Wunsch score table using a score matrix Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 11
12 Solving MSA Pattern databases Family of sequences S = {s 1,, s n }. A pattern is a subset P S, P 2. A pattern database (PDB) is the perfect heuristic h for the subproblem induced by pattern P. Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 12
13 Solving MSA Heuristic search estimators Family of sequences S = {s 1,, s n }. h pair (Ikeda and Imai, 1994): h pair v = 1 i<j n h ij (v) Uses the information of every 2-dimensional PDB Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 13
14 Solving MSA Heuristic search estimators Family of sequences S = {s 1,, s n }. h all,k (Kobayashi and Imai, 1998): h all,k v = 1 n 2 k 2 1 x 1 < <x k n h x 1,,x k v Uses the information of every 3-dimensional PDB Every pair of sequences appears n 2 times normalize k 2 If k = 3, lenghts ~ 500, each PDB contains 10 8 vertices! Branching factor 2 n 1 Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 14
15 Solving MSA Heuristic search estimators Family of sequences S = {s 1,, s n }. h one,k (Kobayashi and Imai, 1998): k n h one,k v = h x 1,,x k v + h x k+1,,x n v + h x i,x j (v) i=1 j=k+1 1 or 2 higher-dimensional PDBs + remaining 2-dimensional PDBs Avoids normalization by choosing PDBs carefully h pair h one,k h all,k Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 15
16 Agenda. 1 Introduction 2 Formal Definition 3 Solving MSA 4 Combining Multiple Pattern Databases 5 Cost Partitioning 6 Experiments 7 Conclusion Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 16
17 Combining Multiple Pattern Databases Additivity A pattern collection of S = s 1,, s n is a collection P = P 1,, P m, P i S. P is non-conflicting, if no pair of elements of P conflict. Then the sum of PDBs is additive Pattern collection heuristic Admissible, if P is non-conflicting m h P v = h P i(v) i=1 Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 17
18 Combining Multiple Pattern Databases Conflicting pattern collections may violate admissibility Parts may still be useful? Canonical PDB heuristic (Haslum et al., 2007) h CAN v = max h P (v) s MNS P S Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 18
19 Combining Multiple Pattern Databases Post-hoc optimization (Pommerening et al., 2013) Use linear programming to solve constrained problem Pattern collection is strictly conflicting if m i=0 P i > 1 Let w 1,, w m be the solution to the linear program that maximizes m h PHO v = w i h P i(v) s. t. w i 1 for all strictly conflicting pattern collections S P i:p i S s. t. 0 w i 1 for all P i i Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 19
20 Combining Multiple Pattern Databases Post-hoc optimization (Pommerening et al., 2013) h all,k equals h PHO if we choose the same patterns Proof sketch: Four sequences S = s 1, s 2, s 3, s 4 of length 1 s 1 = A, s 2 = C, s 3 = T, s 4 = G Score matrix: A C T G A C T G P = P 1 = s 1, s 2, s 3, P 2 = s 1, s 2, s 4,, P 3 = s 1, s 3, s 4,, P 4 = s 2, s 3, s 4 h P 1 s = 3 h P 2 s = h P 3 s = h P 4 s = 1 h PHO s = = 3 = = h all,3 Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 20
21 Combining Multiple Pattern Databases A factored representation of MSA with operators i,j O = o x,y x,y 1 i < j n, 0 x l i, 0 y l j } i,j An operator o x,y x,y affects heuristic h P if s i, s j P Example: e.g. edge 3,3,5 4,3,6 is factored into 3 operators: 1,2 {o 3,3 4,3 1,3, o 3,5 4,6 2,3, o 3,5 3,6 } Basic factors for opreators in higher dimensions Less operators than defining all operators Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 21
22 Agenda. 1 Introduction 2 Formal Definition 3 Solving MSA 4 Combining Multiple Pattern Databases 5 Cost Partitioning 6 Experiments 7 Conclusion Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 22
23 Cost Partitioning Better estimates than using max. among available? Patterns only consider parts of the problem Combine multiple heuristic values Distribute operator costs among them Formal (Seipp et al., 2017) Given a pattern collection of size m Cost partitioning is a tuple C = c 1,, c m CP heuristic is h C v σ m i=1 h P i,c i (v) s. t. σ m i=1 c i o c o Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 23
24 Cost Partitioning Greedy zero-one cost partitioning (Haslum et al. 2005; Edelkamp, 2006) Assign full costs to at most one PDB Multiple PDBs affected? Greedily chose from ordering Assign full costs to c i o if o aff(h P i) and o i 1 j=1 aff(h P j) Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 24
25 ҧ ҧ ҧ Cost Partitioning Saturated cost partitioning (Seipp and Helmert, 2014) Assign exploitable parts of the costs to components Remainder can contribute to other components Saturated cost function Assigns the least possible cost without changing outcome Formal: saturate(h P, c) is the minimal cost function c c with h P,c v = h P,c (v) Saturated cost partitioning C = c 1,, c m remaining cost functions c 0,, c m ҧ c 0 ҧ = c c i = saturate h P i, ҧ c i = c i 1 c i c i 1 Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 25
26 Cost Partitioning Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 26
27 Agenda. 1 Introduction 2 Formal Definition 3 Solving MSA 4 Combining Multiple Pattern Databases 5 Cost Partitioning 6 Experiments 7 Conclusion Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 27
28 Experiments Using MSASolver Java program by Matthew Hatem BAliBASE Benchmark Reference Set 1 (Thompson et al., 1999) Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 28
29 Experiments Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 29
30 Agenda. 1 Introduction 2 Formal Definition 3 Solving MSA 4 Combining Multiple Pattern Databases 5 Cost Partitioning 6 Experiments 7 Conclusion Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 30
31 Conclusion GZOCP No benefit over existing heuristics PHO LP Solver in every search step Expensively computed PDB may be left unused Future Work Implement other cost partitioning techniques Generate PDBs automatically e.g. like Haslum et al. (2007) M&S heuristics (Dräger et al., 2009; Helmert et al., 2014) Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 31
32 Thank you for your attention.
33 Bibliography MO Dayhoff, RM Schwartz, and BC Orcutt. A model of evolutionary change in proteins. In Atlas of protein sequence and structure, volume 5, pages National Biomedical Research Foundation Silver Spring, MD, Steven Henikoff and Jorja G Henikoff. Amino acid substitution matrices from protein blocks. Proceedings of the National Academy of Sciences, 89: , Saul B Needleman and Christian D Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of molecular biology, 48 (3): , Takahiro Ikeda and Hiroshi Imai. Fast a algorithms for multiple sequence alignment. Genome Informatics, 5:90 99, Hirotada Kobayashi and Hiroshi Imai. Improvement of the A* algorithm for multiple sequence alignment. Genome Informatics, 9: , Patrik Haslum, Adi Botea, Malte Helmert, Blai Bonet, Sven Koenig, et al. Domainindependent construction of pattern database heuristics for cost-optimal planning. In AAAI, volume 7, pages , Florian Pommerening, Gabriele Röger, and Malte Helmert. Getting the most out of pattern databases for classical planning. In Francesca Rossi, editor, Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013), pages , Jendrik Seipp, Thomas Keller, and Malte Helmert. A comparison of cost partitioning algorithms for optimal classical planning. In Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS 2017). AAAI Press, Patrik Haslum, Blai Bonet, Héctor Geffner, et al. New admissible heuristics for domainindependent planning. In AAAI, volume 5, pages 9 13, Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 33
34 Bibliography Stefan Edelkamp. Automated creation of pattern database search heuristics. In International Workshop on Model Checking and Artificial Intelligence, pages Springer, Jendrik Seipp and Malte Helmert. Diverse and additive cartesian abstraction heuristics. In Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling (ICAPS 2014). AAAI Press, pages , Julie D. Thompson, Frédéric Plewniak, and Olivier Poch. Balibase: a benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics (Oxford, England), 15:87 88, Klaus Dräger, Bernd Finkbeiner, and Andreas Podelski. Directed model checking with distance-preserving abstractions. International Journal on Software Tools for Technology Transfer, 11(1):27 37, Malte Helmert, Patrik Haslum, Jörg Hoffmann, and Raz Nissim. Merge-and-shrink abstraction: A method for generating lower bounds in factored state spaces. Journal of the ACM (JACM), 61(3):16, Cost Partitioning Techniques for Multiple Sequence Alignment, Mirko Riesterer, Universität Basel 34
Cost Partitioning Techniques For Multiple Sequence Alignment
Cost Partitioning Techniques For Multiple Sequence Alignment Master thesis Faculty of Science Department of Mathematics and Computer Science Artificial Intelligence http://ai.cs.unibas.ch/ Examiner: Prof.
More informationA Comparison of Cost Partitioning Algorithms for Optimal Classical Planning
A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning Jendrik Seipp Thomas Keller Malte Helmert University of Basel June 21, 2017 Setting optimal classical planning A search + admissible
More informationPlanning and Optimization
Planning and Optimization F3. Post-hoc Optimization & Operator Counting Malte Helmert and Gabriele Röger Universität Basel December 6, 2017 Post-hoc Optimization Heuristic Content of this Course: Heuristic
More informationA Comparison of Cost Partitioning Algorithms for Optimal Classical Planning
A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning Jendrik Seipp and Thomas Keller and Malte Helmert University of Basel Basel, Switzerland {jendrik.seipp,tho.keller,malte.helmert}@unibas.ch
More informationFast Downward Cedalion
Fast Downward Cedalion Jendrik Seipp and Silvan Sievers Universität Basel Basel, Switzerland {jendrik.seipp,silvan.sievers}@unibas.ch Frank Hutter Universität Freiburg Freiburg, Germany fh@informatik.uni-freiburg.de
More informationComputational Molecular Biology
Computational Molecular Biology Erwin M. Bakker Lecture 3, mainly from material by R. Shamir [2] and H.J. Hoogeboom [4]. 1 Pairwise Sequence Alignment Biological Motivation Algorithmic Aspect Recursive
More informationAdditive Merge-and-Shrink Heuristics for Diverse Action Costs
Additive Merge-and-Shrink Heuristics for Diverse Action Costs Gaojian Fan, Martin Müller and Robert Holte University of Alberta, Canada {gaojian, mmueller, rholte}@ualberta.ca Abstract In many planning
More informationPrinciples of Bioinformatics. BIO540/STA569/CSI660 Fall 2010
Principles of Bioinformatics BIO540/STA569/CSI660 Fall 2010 Lecture 11 Multiple Sequence Alignment I Administrivia Administrivia The midterm examination will be Monday, October 18 th, in class. Closed
More informationLecture 5: Multiple sequence alignment
Lecture 5: Multiple sequence alignment Introduction to Computational Biology Teresa Przytycka, PhD (with some additions by Martin Vingron) Why do we need multiple sequence alignment Pairwise sequence alignment
More informationCISC 889 Bioinformatics (Spring 2003) Multiple Sequence Alignment
CISC 889 Bioinformatics (Spring 2003) Multiple Sequence Alignment Courtesy of jalview 1 Motivations Collective statistic Protein families Identification and representation of conserved sequence features
More informationPROTEIN MULTIPLE ALIGNMENT MOTIVATION: BACKGROUND: Marina Sirota
Marina Sirota MOTIVATION: PROTEIN MULTIPLE ALIGNMENT To study evolution on the genetic level across a wide range of organisms, biologists need accurate tools for multiple sequence alignment of protein
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 39. Automated Planning: Landmark Heuristics Malte Helmert and Gabriele Röger University of Basel May 10, 2017 Automated Planning: Overview Chapter overview: planning
More informationAlgorithmic Approaches for Biological Data, Lecture #20
Algorithmic Approaches for Biological Data, Lecture #20 Katherine St. John City University of New York American Museum of Natural History 20 April 2016 Outline Aligning with Gaps and Substitution Matrices
More informationInverse Sequence Alignment from Partial Examples
Inverse Sequence Alignment from Partial Examples Eagu Kim and John Kececioglu Department of Computer Science The University of Arizona, Tucson AZ 85721, USA {egkim,kece}@cs.arizona.edu Abstract. When aligning
More informationOverestimation for Multiple Sequence Alignment
Overestimation for Multiple Sequence Alignment Tristan Cazenave L.I.A.S.D. Dept. Informatique Université Paris 8 cazenave@ai.univ-paris8.fr Abstract Multiple sequence alignment is an important problem
More informationFrom Non-Negative to General Operator Cost Partitioning
From Non-Negative to General Operator Cost Partitioning Florian Pommerening and Malte Helmert and Gabriele Röger and Jendrik Seipp University of Basel Basel, Switzerland {florian.pommerening,malte.helmert,gabriele.roeger,jendrik.seipp}@unibas.ch
More informationGLOBEX Bioinformatics (Summer 2015) Multiple Sequence Alignment
GLOBEX Bioinformatics (Summer 2015) Multiple Sequence Alignment Scoring Dynamic Programming algorithms Heuristic algorithms CLUSTAL W Courtesy of jalview Motivations Collective (or aggregate) statistic
More informationEarly Work on Optimization-Based Heuristics for the Sliding Tile Puzzle
Planning, Search, and Optimization: Papers from the 2015 AAAI Workshop Early Work on Optimization-Based Heuristics for the Sliding Tile Puzzle Ariel Felner ISE Department Ben-Gurion University Israel felner@bgu.ac.il
More informationRecent Research Results. Evolutionary Trees Distance Methods
Recent Research Results Evolutionary Trees Distance Methods Indo-European Languages After Tandy Warnow What is the purpose? Understand evolutionary history (relationship between species). Uderstand how
More informationSpecial course in Computer Science: Advanced Text Algorithms
Special course in Computer Science: Advanced Text Algorithms Lecture 8: Multiple alignments Elena Czeizler and Ion Petre Department of IT, Abo Akademi Computational Biomodelling Laboratory http://www.users.abo.fi/ipetre/textalg
More information.. Fall 2011 CSC 570: Bioinformatics Alexander Dekhtyar..
.. Fall 2011 CSC 570: Bioinformatics Alexander Dekhtyar.. PAM and BLOSUM Matrices Prepared by: Jason Banich and Chris Hoover Background As DNA sequences change and evolve, certain amino acids are more
More informationBLAST MCDB 187. Friday, February 8, 13
BLAST MCDB 187 BLAST Basic Local Alignment Sequence Tool Uses shortcut to compute alignments of a sequence against a database very quickly Typically takes about a minute to align a sequence against a database
More informationSolving Sokoban Optimally using Pattern Databases for Deadlock Detection
Solving Sokoban Optimally using Pattern Databases for Deadlock Detection André G. Pereira, Marcus Ritt, Luciana S. Buriol Institute of Informatics Federal University of Rio Grande do Sul, Brazil {agpereira,marcus.ritt,buriol
More informationEECS730: Introduction to Bioinformatics
EECS730: Introduction to Bioinformatics Lecture 06: Multiple Sequence Alignment https://upload.wikimedia.org/wikipedia/commons/thumb/7/79/rplp0_90_clustalw_aln.gif/575px-rplp0_90_clustalw_aln.gif Slides
More informationResearch Article International Journals of Advanced Research in Computer Science and Software Engineering ISSN: X (Volume-7, Issue-6)
International Journals of Advanced Research in Computer Science and Software Engineering ISSN: 77-18X (Volume-7, Issue-6) Research Article June 017 DDGARM: Dotlet Driven Global Alignment with Reduced Matrix
More informationDistributed Protein Sequence Alignment
Distributed Protein Sequence Alignment ABSTRACT J. Michael Meehan meehan@wwu.edu James Hearne hearne@wwu.edu Given the explosive growth of biological sequence databases and the computational complexity
More informationDynamic Programming & Smith-Waterman algorithm
m m Seminar: Classical Papers in Bioinformatics May 3rd, 2010 m m 1 2 3 m m Introduction m Definition is a method of solving problems by breaking them down into simpler steps problem need to contain overlapping
More informationMultiple sequence alignment. November 20, 2018
Multiple sequence alignment November 20, 2018 Why do multiple alignment? Gain insight into evolutionary history Can assess time of divergence by looking at the number of mutations needed to change one
More informationLecture 10. Sequence alignments
Lecture 10 Sequence alignments Alignment algorithms: Overview Given a scoring system, we need to have an algorithm for finding an optimal alignment for a pair of sequences. We want to maximize the score
More informationDomain-Dependent Heuristics and Tie-Breakers: Topics in Automated Planning
Domain-Dependent Heuristics and Tie-Breakers: Topics in Automated Planning Augusto B. Corrêa, André G. Pereira, Marcus Ritt 1 Instituto de Informática Universidade Federal do Rio Grande do Sul (UFRGS)
More informationResearch Article Aligning Sequences by Minimum Description Length
Hindawi Publishing Corporation EURASIP Journal on Bioinformatics and Systems Biology Volume 2007, Article ID 72936, 14 pages doi:10.1155/2007/72936 Research Article Aligning Sequences by Minimum Description
More informationComputational Genomics and Molecular Biology, Fall
Computational Genomics and Molecular Biology, Fall 2015 1 Sequence Alignment Dannie Durand Pairwise Sequence Alignment The goal of pairwise sequence alignment is to establish a correspondence between the
More informationMultiple Sequence Alignment. Mark Whitsitt - NCSA
Multiple Sequence Alignment Mark Whitsitt - NCSA What is a Multiple Sequence Alignment (MA)? GMHGTVYANYAVDSSDLLLAFGVRFDDRVTGKLEAFASRAKIVHIDIDSAEIGKNKQPHV GMHGTVYANYAVEHSDLLLAFGVRFDDRVTGKLEAFASRAKIVHIDIDSAEIGKNKTPHV
More informationCounterexample-guided Cartesian Abstraction Refinement
Counterexample-guided Cartesian Abstraction Refinement Jendrik Seipp and Malte Helmert Universität Basel Basel, Switzerland {jendrik.seipp,malte.helmert}@unibas.ch Abstract Counterexample-guided abstraction
More informationMetis: Arming Fast Downward with Pruning and Incremental Computation
Metis: Arming Fast Downward with Pruning and Incremental Computation Yusra Alkhazraji University of Freiburg, Germany alkhazry@informatik.uni-freiburg.de Florian Pommerening University of Basel, Switzerland
More informationA New Approach For Tree Alignment Based on Local Re-Optimization
A New Approach For Tree Alignment Based on Local Re-Optimization Feng Yue and Jijun Tang Department of Computer Science and Engineering University of South Carolina Columbia, SC 29063, USA yuef, jtang
More informationFlexible Abstraction Heuristics for Optimal Sequential Planning
Flexible Abstraction Heuristics for Optimal Sequential Planning Malte Helmert Albert-Ludwigs-Universität Freiburg Institut für Informatik Georges-Köhler-Allee 52 79110 Freiburg, Germany helmert@informatik.uni-freiburg.de
More informationPoMSA: An Efficient and Precise Position-based Multiple Sequence Alignment Technique
PoMSA: An Efficient and Precise Position-based Multiple Sequence Alignment Technique Sara Shehab 1,a, Sameh Shohdy 1,b, Arabi E. Keshk 1,c 1 Department of Computer Science, Faculty of Computers and Information,
More informationBiological Sequence Matching Using Fuzzy Logic
International Journal of Scientific & Engineering Research Volume 2, Issue 7, July-2011 1 Biological Sequence Matching Using Fuzzy Logic Nivit Gill, Shailendra Singh Abstract: Sequence alignment is the
More informationComparison of Sequence Similarity Measures for Distant Evolutionary Relationships
Comparison of Sequence Similarity Measures for Distant Evolutionary Relationships Abhishek Majumdar, Peter Z. Revesz Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln,
More informationRegular Expression Constrained Sequence Alignment
Regular Expression Constrained Sequence Alignment By Abdullah N. Arslan Department of Computer science University of Vermont Presented by Tomer Heber & Raz Nissim otivation When comparing two proteins,
More information) I R L Press Limited, Oxford, England. The protein identification resource (PIR)
Volume 14 Number 1 Volume 1986 Nucleic Acids Research 14 Number 1986 Nucleic Acids Research The protein identification resource (PIR) David G.George, Winona C.Barker and Lois T.Hunt National Biomedical
More informationBioinformatics for Biologists
Bioinformatics for Biologists Sequence Analysis: Part I. Pairwise alignment and database searching Fran Lewitter, Ph.D. Director Bioinformatics & Research Computing Whitehead Institute Topics to Cover
More informationLecture 9: Core String Edits and Alignments
Biosequence Algorithms, Spring 2005 Lecture 9: Core String Edits and Alignments Pekka Kilpeläinen University of Kuopio Department of Computer Science BSA Lecture 9: String Edits and Alignments p.1/30 III:
More informationAlignment of Trees and Directed Acyclic Graphs
Alignment of Trees and Directed Acyclic Graphs Gabriel Valiente Algorithms, Bioinformatics, Complexity and Formal Methods Research Group Technical University of Catalonia Computational Biology and Bioinformatics
More informationLearning Parameter Sets for Alignment Advising
Learning Parameter Sets for Alignment Advising Dan DeBlasio Department of Computer Science The University of Arizona Tucson AZ 85721, USA deblasio@cs.arizona.edu John Kececioglu Department of Computer
More informationAn Analysis of Pairwise Sequence Alignment Algorithm Complexities: Needleman-Wunsch, Smith-Waterman, FASTA, BLAST and Gapped BLAST
An Analysis of Pairwise Sequence Alignment Algorithm Complexities: Needleman-Wunsch, Smith-Waterman, FASTA, BLAST and Gapped BLAST Alexander Chan 5075504 Biochemistry 218 Final Project An Analysis of Pairwise
More informationComputational Molecular Biology
Computational Molecular Biology Erwin M. Bakker Lecture 2 Materials used from R. Shamir [2] and H.J. Hoogeboom [4]. 1 Molecular Biology Sequences DNA A, T, C, G RNA A, U, C, G Protein A, R, D, N, C E,
More informationData Mining Technologies for Bioinformatics Sequences
Data Mining Technologies for Bioinformatics Sequences Deepak Garg Computer Science and Engineering Department Thapar Institute of Engineering & Tecnology, Patiala Abstract Main tool used for sequence alignment
More informationBiologically significant sequence alignments using Boltzmann probabilities
Biologically significant sequence alignments using Boltzmann probabilities P Clote Department of Biology, Boston College Gasson Hall 16, Chestnut Hill MA 0267 clote@bcedu Abstract In this paper, we give
More informationProfiles and Multiple Alignments. COMP 571 Luay Nakhleh, Rice University
Profiles and Multiple Alignments COMP 571 Luay Nakhleh, Rice University Outline Profiles and sequence logos Profile hidden Markov models Aligning profiles Multiple sequence alignment by gradual sequence
More informationAlgorithms for Bioinformatics
Adapted from slides by Leena Salmena and Veli Mäkinen, which are partly from http: //bix.ucsd.edu/bioalgorithms/slides.php. 582670 Algorithms for Bioinformatics Lecture 6: Distance based clustering and
More informationGenetics/MBT 541 Spring, 2002 Lecture 1 Joe Felsenstein Department of Genome Sciences Phylogeny methods, part 1 (Parsimony and such)
Genetics/MBT 541 Spring, 2002 Lecture 1 Joe Felsenstein Department of Genome Sciences joe@gs Phylogeny methods, part 1 (Parsimony and such) Methods of reconstructing phylogenies (evolutionary trees) Parsimony
More informationSequence alignment algorithms
Sequence alignment algorithms Bas E. Dutilh Systems Biology: Bioinformatic Data Analysis Utrecht University, February 23 rd 27 After this lecture, you can decide when to use local and global sequence alignments
More information24 Grundlagen der Bioinformatik, SS 10, D. Huson, April 26, This lecture is based on the following papers, which are all recommended reading:
24 Grundlagen der Bioinformatik, SS 10, D. Huson, April 26, 2010 3 BLAST and FASTA This lecture is based on the following papers, which are all recommended reading: D.J. Lipman and W.R. Pearson, Rapid
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 37. Automated Planning: Abstraction and Pattern Databases Martin Wehrle Universität Basel May 13, 2016 Planning Heuristics We consider three basic ideas for general
More informationEvolutionary tree reconstruction (Chapter 10)
Evolutionary tree reconstruction (Chapter 10) Early Evolutionary Studies Anatomical features were the dominant criteria used to derive evolutionary relationships between species since Darwin till early
More informationSalvador Capella-Gutiérrez, Jose M. Silla-Martínez and Toni Gabaldón
trimal: a tool for automated alignment trimming in large-scale phylogenetics analyses Salvador Capella-Gutiérrez, Jose M. Silla-Martínez and Toni Gabaldón Version 1.2b Index of contents 1. General features
More informationMultiple sequence alignment. November 2, 2017
Multiple sequence alignment November 2, 2017 Why do multiple alignment? Gain insight into evolutionary history Can assess time of divergence by looking at the number of mutations needed to change one sequence
More informationImproving the Divide-and-Conquer Approach to Sum-of-Pairs Multiple Sequence Alignment
Pergamon Appl. Math. Lett. Vol. 10, No. 2, pp. 67-73, 1997 Copyright 1997 Elsevier Science Ltd Printed in Great Britain. All rights reserved 0893-9659/97 $17.00 + 0.00 PII: S0893-9659(97)00013-X Improving
More informationICB Fall G4120: Introduction to Computational Biology. Oliver Jovanovic, Ph.D. Columbia University Department of Microbiology
ICB Fall 2008 G4120: Computational Biology Oliver Jovanovic, Ph.D. Columbia University Department of Microbiology Copyright 2008 Oliver Jovanovic, All Rights Reserved. The Digital Language of Computers
More informationScoring and heuristic methods for sequence alignment CG 17
Scoring and heuristic methods for sequence alignment CG 17 Amino Acid Substitution Matrices Used to score alignments. Reflect evolution of sequences. Unitary Matrix: M ij = 1 i=j { 0 o/w Genetic Code Matrix:
More informationMultiple Sequence Alignment: Multidimensional. Biological Motivation
Multiple Sequence Alignment: Multidimensional Dynamic Programming Boston University Biological Motivation Compare a new sequence with the sequences in a protein family. Proteins can be categorized into
More informationMetric Indexing of Protein Databases and Promising Approaches
WDS'07 Proceedings of Contributed Papers, Part I, 91 97, 2007. ISBN 978-80-7378-023-4 MATFYZPRESS Metric Indexing of Protein Databases and Promising Approaches D. Hoksza Charles University, Faculty of
More informationJyoti Lakhani 1, Ajay Khunteta 2, Dharmesh Harwani *3 1 Poornima University, Jaipur & Maharaja Ganga Singh University, Bikaner, Rajasthan, India
International Journal of Scientific Research in Computer Science, Engineering and Information Technology 2017 IJSRCSEIT Volume 2 Issue 6 ISSN : 2456-3307 Improvisation of Global Pairwise Sequence Alignment
More informationMaximizing Occupancy of GPU for Fast Scanning Biological Database Using Sequence Alignment
JOURNAL OF APPLIED SCIENCES RESEARCH ISSN: 1819-544X Published BYAENSI Publication EISSN: 1816-157X http://www.aensiweb.com/jasr 2017 June; 13(6): pages 45-51 Open Access Journal Maximizing Occupancy of
More informationPairwise Sequence Alignment: Dynamic Programming Algorithms. COMP Spring 2015 Luay Nakhleh, Rice University
Pairwise Sequence Alignment: Dynamic Programming Algorithms COMP 571 - Spring 2015 Luay Nakhleh, Rice University DP Algorithms for Pairwise Alignment The number of all possible pairwise alignments (if
More informationAlignment ABC. Most slides are modified from Serafim s lectures
Alignment ABC Most slides are modified from Serafim s lectures Complete genomes Evolution Evolution at the DNA level C ACGGTGCAGTCACCA ACGTTGCAGTCCACCA SEQUENCE EDITS REARRANGEMENTS Sequence conservation
More informationComparison and Evaluation of Multiple Sequence Alignment Tools In Bininformatics
IJCSNS International Journal of Computer Science and Network Security, VOL.9 No.7, July 2009 51 Comparison and Evaluation of Multiple Sequence Alignment Tools In Bininformatics Asieh Sedaghatinia, Dr Rodziah
More informationHIDDEN MARKOV MODELS AND SEQUENCE ALIGNMENT
HIDDEN MARKOV MODELS AND SEQUENCE ALIGNMENT - Swarbhanu Chatterjee. Hidden Markov models are a sophisticated and flexible statistical tool for the study of protein models. Using HMMs to analyze proteins
More informationMULTIPLE SEQUENCE ALIGNMENT SOLUTIONS AND APPLICATIONS
MULTIPLE SEQUENCE ALIGNMENT SOLUTIONS AND APPLICATIONS By XU ZHANG A DISSERTATION PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE
More informationAs of August 15, 2008, GenBank contained bases from reported sequences. The search procedure should be
48 Bioinformatics I, WS 09-10, S. Henz (script by D. Huson) November 26, 2009 4 BLAST and BLAT Outline of the chapter: 1. Heuristics for the pairwise local alignment of two sequences 2. BLAST: search and
More informationHow Good is Almost Perfect?
How Good is Almost Perfect? Malte Helmert and Gabriele Röger Albert-Ludwigs-Universität Freiburg, Germany {helmert,roeger}@informatik.uni-freiburg.de Abstract Heuristic search using algorithms such as
More informationFast Kernels for Inexact String Matching
Fast Kernels for Inexact String Matching Christina Leslie and Rui Kuang Columbia University, New York NY 10027, USA {rkuang,cleslie}@cs.columbia.edu Abstract. We introduce several new families of string
More informationBLAST, Profile, and PSI-BLAST
BLAST, Profile, and PSI-BLAST Jianlin Cheng, PhD School of Electrical Engineering and Computer Science University of Central Florida 26 Free for academic use Copyright @ Jianlin Cheng & original sources
More informationFast Sequence Alignment Method Using CUDA-enabled GPU
Fast Sequence Alignment Method Using CUDA-enabled GPU Yeim-Kuan Chang Department of Computer Science and Information Engineering National Cheng Kung University Tainan, Taiwan ykchang@mail.ncku.edu.tw De-Yu
More informationBasic Local Alignment Search Tool (BLAST)
BLAST 26.04.2018 Basic Local Alignment Search Tool (BLAST) BLAST (Altshul-1990) is an heuristic Pairwise Alignment composed by six-steps that search for local similarities. The most used access point to
More information1. R. Durbin, S. Eddy, A. Krogh und G. Mitchison: Biological sequence analysis, Cambridge, 1998
7 Multiple Sequence Alignment The exposition was prepared by Clemens GrÃP pl, based on earlier versions by Daniel Huson, Knut Reinert, and Gunnar Klau. It is based on the following sources, which are all
More informationGenome 559: Introduction to Statistical and Computational Genomics. Lecture15a Multiple Sequence Alignment Larry Ruzzo
Genome 559: Introduction to Statistical and Computational Genomics Lecture15a Multiple Sequence Alignment Larry Ruzzo 1 Multiple Alignment: Motivations Common structure, function, or origin may be only
More informationMultiple Sequence Alignment Based on Profile Alignment of Intermediate Sequences
Multiple Sequence Alignment Based on Profile Alignment of Intermediate Sequences Yue Lu and Sing-Hoi Sze RECOMB 2007 Presented by: Wanxing Xu March 6, 2008 Content Biology Motivation Computation Problem
More informationAlgorithms for context prediction in Ubiquitous Systems
Algorithms for context prediction in Ubiquitous Systems Prediction by alignment methods Stephan Sigg Institute of Distributed and Ubiquitous Systems Technische Universität Braunschweig January 6, 2009
More informationDatabase Similarity Searching
An Introduction to Bioinformatics BSC4933/ISC5224 Florida State University Feb. 23, 2009 Database Similarity Searching Steven M. Thompson Florida State University of Department Scientific Computing How
More information1. R. Durbin, S. Eddy, A. Krogh und G. Mitchison: Biological sequence analysis, Cambridge, 1998
7 Multiple Sequence Alignment The exposition was prepared by Clemens Gröpl, based on earlier versions by Daniel Huson, Knut Reinert, and Gunnar Klau. It is based on the following sources, which are all
More informationSequence analysis Pairwise sequence alignment
UMF11 Introduction to bioinformatics, 25 Sequence analysis Pairwise sequence alignment 1. Sequence alignment Lecturer: Marina lexandersson 12 September, 25 here are two types of sequence alignments, global
More informationBLAST & Genome assembly
BLAST & Genome assembly Solon P. Pissis Tomáš Flouri Heidelberg Institute for Theoretical Studies May 15, 2014 1 BLAST What is BLAST? The algorithm 2 Genome assembly De novo assembly Mapping assembly 3
More informationMolecular Evolution & Phylogenetics Complexity of the search space, distance matrix methods, maximum parsimony
Molecular Evolution & Phylogenetics Complexity of the search space, distance matrix methods, maximum parsimony Basic Bioinformatics Workshop, ILRI Addis Ababa, 12 December 2017 Learning Objectives understand
More informationBasics of Multiple Sequence Alignment
Basics of Multiple Sequence Alignment Tandy Warnow February 10, 2018 Basics of Multiple Sequence Alignment Tandy Warnow Basic issues What is a multiple sequence alignment? Evolutionary processes operating
More informationNew Optimization Functions for Potential Heuristics
New Optimization Functions for Potential Heuristics Jendrik eipp and Florian Pommerening and Malte Helmert University of Basel Basel, witzerland {jendrik.seipp,florian.pommerening,malte.helmert}@unibas.ch
More informationReconstructing long sequences from overlapping sequence fragment. Searching databases for related sequences and subsequences
SEQUENCE ALIGNMENT ALGORITHMS 1 Why compare sequences? Reconstructing long sequences from overlapping sequence fragment Searching databases for related sequences and subsequences Storing, retrieving and
More informationBLAST: Basic Local Alignment Search Tool Altschul et al. J. Mol Bio CS 466 Saurabh Sinha
BLAST: Basic Local Alignment Search Tool Altschul et al. J. Mol Bio. 1990. CS 466 Saurabh Sinha Motivation Sequence homology to a known protein suggest function of newly sequenced protein Bioinformatics
More informationHeuristic Subset Selection in Classical Planning
Heuristic Subset Selection in Classical Planning Levi H. S. Lelis Santiago Franco Marvin Abisrror Dept. de Informática Universidade Federal de Viçosa Viçosa, Brazil Mike Barley Comp. Science Dept. Auckland
More informationBioinformatics explained: Smith-Waterman
Bioinformatics Explained Bioinformatics explained: Smith-Waterman May 1, 2007 CLC bio Gustav Wieds Vej 10 8000 Aarhus C Denmark Telephone: +45 70 22 55 09 Fax: +45 70 22 55 19 www.clcbio.com info@clcbio.com
More informationSequence clustering. Introduction. Clustering basics. Hierarchical clustering
Sequence clustering Introduction Data clustering is one of the key tools used in various incarnations of data-mining - trying to make sense of large datasets. It is, thus, natural to ask whether clustering
More informationA Study On Pair-Wise Local Alignment Of Protein Sequence For Identifying The Structural Similarity
A Study On Pair-Wise Local Alignment Of Protein Sequence For Identifying The Structural Similarity G. Pratyusha, Department of Computer Science & Engineering, V.R.Siddhartha Engineering College(Autonomous)
More informationEECS 4425: Introductory Computational Bioinformatics Fall Suprakash Datta
EECS 4425: Introductory Computational Bioinformatics Fall 2018 Suprakash Datta datta [at] cse.yorku.ca Office: CSEB 3043 Phone: 416-736-2100 ext 77875 Course page: http://www.cse.yorku.ca/course/4425 Many
More informationDesigning parallel algorithms for constructing large phylogenetic trees on Blue Waters
Designing parallel algorithms for constructing large phylogenetic trees on Blue Waters Erin Molloy University of Illinois at Urbana Champaign General Allocation (PI: Tandy Warnow) Exploratory Allocation
More informationA FAST LONGEST COMMON SUBSEQUENCE ALGORITHM FOR BIOSEQUENCES ALIGNMENT
A FAST LONGEST COMMON SUBSEQUENCE ALGORITHM FOR BIOSEQUENCES ALIGNMENT Wei Liu 1,*, Lin Chen 2, 3 1 Institute of Information Science and Technology, Nanjing University of Aeronautics and Astronautics,
More informationProgramming assignment for the course Sequence Analysis (2006)
Programming assignment for the course Sequence Analysis (2006) Original text by John W. Romein, adapted by Bart van Houte (bart@cs.vu.nl) Introduction Please note: This assignment is only obligatory for
More informationMultiple Sequence Alignment (MSA)
I519 Introduction to Bioinformatics, Fall 2013 Multiple Sequence Alignment (MSA) Yuzhen Ye (yye@indiana.edu) School of Informatics & Computing, IUB Outline Multiple sequence alignment (MSA) Generalize
More informationLecture Overview. Sequence search & alignment. Searching sequence databases. Sequence Alignment & Search. Goals: Motivations:
Lecture Overview Sequence Alignment & Search Karin Verspoor, Ph.D. Faculty, Computational Bioscience Program University of Colorado School of Medicine With credit and thanks to Larry Hunter for creating
More information