Molecular Evolution and Phylogeny. Based on: Durbin et al Chapter 8

Similar documents
What is maximum Likelihood? History Features of ML method Tools used Advantages Disadvantages Evolutionary models

Sections 3.1 and 3.4 Exponential Functions (Growth and Decay)

PHYS GENERAL RELATIVITY AND COSMOLOGY PROBLEM SET 7 - SOLUTIONS

Lecture 18: Kinetics of Phase Growth in a Two-component System: general kinetics analysis based on the dilute-solution approximation

5.2 GRAPHICAL VELOCITY ANALYSIS Polygon Method

Support Vector Machines

, the. L and the L. x x. max. i n. It is easy to show that these two norms satisfy the following relation: x x n x = (17.3) max

Lecture 26: Leapers and Creepers

Circular Motion. Radians. One revolution is equivalent to which is also equivalent to 2π radians. Therefore we can.

Randomized Perfect Bipartite Matching

Exponential and Logarithmic Equations and Properties of Logarithms. Properties. Properties. log. Exponential. Logarithmic.

Lecture 17: Kinetics of Phase Growth in a Two-component System:

ÖRNEK 1: THE LINEAR IMPULSE-MOMENTUM RELATION Calculate the linear momentum of a particle of mass m=10 kg which has a. kg m s

Let. x y. denote a bivariate time series with zero mean.

EE202 Circuit Theory II

On The Estimation of Two Missing Values in Randomized Complete Block Designs

Explicit form of global solution to stochastic logistic differential equation and related topics

Lecture-V Stochastic Processes and the Basic Term-Structure Equation 1 Stochastic Processes Any variable whose value changes over time in an uncertain

Combinatorial Approach to M/M/1 Queues. Using Hypergeometric Functions

2. VECTORS. R Vectors are denoted by bold-face characters such as R, V, etc. The magnitude of a vector, such as R, is denoted as R, R, V

Consider a Binary antipodal system which produces data of δ (t)

EECE 301 Signals & Systems Prof. Mark Fowler

Main Reference: Sections in CLRS.

Laplace Transform. Inverse Laplace Transform. e st f(t)dt. (2)

18.03SC Unit 3 Practice Exam and Solutions

UT Austin, ECE Department VLSI Design 5. CMOS Gate Characteristics

Low-complexity Algorithms for MIMO Multiplexing Systems

Representing Knowledge. CS 188: Artificial Intelligence Fall Properties of BNs. Independence? Reachability (the Bayes Ball) Example

The distribution of the interval of the Cox process with shot noise intensity for insurance claims and its moments

AB for hydrogen in steel is What is the molar flux of the hydrogen through the steel? Δx Wall. s kmole

u(t) Figure 1. Open loop control system

MATHEMATICAL FOUNDATIONS FOR APPROXIMATING PARTICLE BEHAVIOUR AT RADIUS OF THE PLANCK LENGTH

1 Motivation and Basic Definitions

Exponential Smoothing

The Residual Graph. 11 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm

General Non-Arbitrage Model. I. Partial Differential Equation for Pricing A. Traded Underlying Security

Fall 2004/05 Solutions to Assignment 5: The Stationary Phase Method Provided by Mustafa Sabri Kilic. I(x) = e ixt e it5 /5 dt (1) Z J(λ) =

The sudden release of a large amount of energy E into a background fluid of density

8.5 Circles and Lengths of Segments

Lecture 22 Electromagnetic Waves

Control Volume Derivation

Department of Chemical Engineering University of Tennessee Prof. David Keffer. Course Lecture Notes SIXTEEN

Macroeconomics 1. Ali Shourideh. Final Exam

MEEN 617 Handout #11 MODAL ANALYSIS OF MDOF Systems with VISCOUS DAMPING

The Residual Graph. 12 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm

To become more mathematically correct, Circuit equations are Algebraic Differential equations. from KVL, KCL from the constitutive relationship

On Control Problem Described by Infinite System of First-Order Differential Equations

Probabilistic Models. CS 188: Artificial Intelligence Fall Independence. Example: Independence. Example: Independence? Conditional Independence

Curvature. Institute of Lifelong Learning, University of Delhi pg. 1

The International Diversification Puzzle when Goods Prices are Sticky: It s Really about Exchange-Rate Hedging, not Equity Portfolios

Introduction to SLE Lecture Notes

L. Yaroslavsky. Image data fusion. Processing system. Input scene. Output images

Chapter 8 Objectives

Orthotropic Materials

AN EVOLUTIONARY APPROACH FOR SOLVING DIFFERENTIAL EQUATIONS

ONTHEPATHWISEUNIQUENESSOF STOCHASTIC PARTIAL DIFFERENTIAL EQUATIONS WITH NON-LIPSCHITZ COEFFICIENTS

Identification of Fault Locations using Transient State Estimation

6.8 Laplace Transform: General Formulas

IX.1.1 The Laplace Transform Definition 700. IX.1.2 Properties 701. IX.1.3 Examples 702. IX.1.4 Solution of IVP for ODEs 704

Admin MAX FLOW APPLICATIONS. Flow graph/networks. Flow constraints 4/30/13. CS lunch today Grading. in-flow = out-flow for every vertex (except s, t)

CS 188: Artificial Intelligence Fall Probabilistic Models

FLAT CYCLOTOMIC POLYNOMIALS OF ORDER FOUR AND HIGHER

Inference for A One Way Factorial Experiment. By Ed Stanek and Elaine Puleo

Feedback Couplings in Chemical Reactions

CHAPTER 7: SECOND-ORDER CIRCUITS

Identification of the Solution of the Burgers. Equation on a Finite Interval via the Solution of an. Appropriate Stochastic Control Problem

Buckling of a structure means failure due to excessive displacements (loss of structural stiffness), and/or

Excel-Based Solution Method For The Optimal Policy Of The Hadley And Whittin s Exact Model With Arma Demand

Today - Lecture 13. Today s lecture continue with rotations, torque, Note that chapters 11, 12, 13 all involve rotations

MATHEMATICS PAPER 121/2 K.C.S.E QUESTIONS SECTION 1 ( 52 MARKS) 3. Simplify as far as possible, leaving your answer in the form of surd

Asymptotic Equipartition Property - Seminar 3, part 1

On the Benney Lin and Kawahara Equations

CONTROL SYSTEMS. Chapter 10 : State Space Response

Degree of Approximation of a Class of Function by (C, 1) (E, q) Means of Fourier Series

Introduction to Congestion Games

Additional Methods for Solving DSGE Models

The Production of Polarization

Instrumentation & Process Control

Chapter 4. Truncation Errors

Problem Set If all directed edges in a network have distinct capacities, then there is a unique maximum flow.

Network Flow. Data Structures and Algorithms Andrei Bulatov

Exponential Sawtooth

Lecture 5. Chapter 3. Electromagnetic Theory, Photons, and Light

Rough Paths and its Applications in Machine Learning

CONTROL SYSTEMS. Chapter 3 Mathematical Modelling of Physical Systems-Laplace Transforms. Prof.Dr. Fatih Mehmet Botsalı

INTRODUCTION TO INERTIAL CONFINEMENT FUSION

Q & Particle-Gas Multiphase Flow. Particle-Gas Interaction. Particle-Particle Interaction. Two-way coupling fluid particle. Mass. Momentum.

7 Wave Equation in Higher Dimensions

The Global Trade and Environment Model: GTEM

Sample Final Exam (finals03) Covering Chapters 1-9 of Fundamentals of Signals & Systems

Chapter 7: Inverse-Response Systems

Chapter Finite Difference Method for Ordinary Differential Equations

Kalman filtering for maximum likelihood estimation given corrupted observations.

Penalization method for a nonlinear Neumann PDE via weak solutions of reflected SDEs

Algorithms and Data Structures 2011/12 Week 9 Solutions (Tues 15th - Fri 18th Nov)

, on the power of the transmitter P t fed to it, and on the distance R between the antenna and the observation point as. r r t

Engineering Accreditation. Heat Transfer Basics. Assessment Results II. Assessment Results. Review Definitions. Outline

Research Article Existence and Uniqueness of Solutions for a Class of Nonlinear Stochastic Differential Equations

MATHEMATICAL DESCRIPTION OF THEORETICAL METHODS OF RESERVE ECONOMY OF CONSIGNMENT STORES

Overview. Overview Page 1 of 8

Transcription:

Molecula Evoluion and hylogeny Baed on: Dubin e al Chape 8.

hylogeneic Tee umpion banch inenal node leaf Topology T : bifucaing Leave - N Inenal node N+ N- Lengh { i } fo each banch hylogeneic ee Topology Lengh T

Maimum Likelihood ppoach Conide he phylogeneic ee o be a ochaic poce. G Unobeved G GG G Obeved The pobabiliy of aniion fom chaace a o chaace b i given by paamee θ ba. The pobabiliy of lee a in he oo i q a. Thee paamee ae defined via ae of change pe ime uni ime he ime uni. Given he complee ee he pobabiliy of daa i defined by he value of he θ ba and he q a.

Maimum Likelihood ppoach ume each ie evolve independenly of he ohe. G G G G DTee θ i D i Tee θ Wie down he likelihood of he daa leave equence given each ee. Ue EM o eimae he θ ba paamee. When he ee i no given: Seach fo he ee ha maimize DTee θ EM i D i Tee θ EM

obabiliic Mehod The phylogeneic ee epeen a geneaive pobabiliic model like HMM fo he obeved equence. Backgound pobabiliie: q a Muaion pobabiliie: a b Model fo evoluionay muaion Juke Cano Kimua -paamee model Such model ae ued o deive he pobabiliie

Juke Cano model model fo muaion ae Muaion occu a a conan ae Each nucleoide i equally likely o muae ino any ohe nucleoide wih ae.

The Juke-Cano model 969 We need o develop a fomula fo DN evoluion via oby whee and y ae aken fom { C G T} and i he ime lengh. Juke-Cano aume equal ae of change: G T C - T G C R T G C

The Juke-Cano model Con. We denoe by S he aniion pobabiliie: K K K k K K S We aume he mai i muliplicaive in he ene ha: S + S S fo any ime lengh o.

The Juke-Cano model Con. Fo a ho ime peiod ε we wie: ε + ε S ε I Rε ε ε ε ε ε ε ε ε ε ε ε ε ε ε By muliplicaively: S+ ε S Sε SI+Rε Hence: [S+ ε - S] /ε S R Leading o he linea diffeenial equaion: S SR Wih he addiional condiion ha in he limi a goe o infiniy:

The Juke-Cano model Con. Subiuing S ino he diffeenial equaion yield: + + Yielding he unique oluion which i known a he Juke-Cano model: e e +

Kimua -paamee model llow a diffeen ae fo aniion and anveion.

Kimua K model 980 Juke-Cano model doe no ake ino accoun ha aniion ae beween puine G and beween pymidine C T ae diffeen fom anveion ae of C T C G G T. Kimua ued a diffeen ae mai: T G C R T G C

Kimua K model Con. u u u u S u e e u e + + Leading uing imila mehod o: Whee:

Muaion obabiliie Boh model aify he following popeie: Lack of memoy: + ' a c ' b a b b c Reveibiliy: Ei aionay pobabiliie { a }.. a a b b b a G C T

obabiliic ppoach Given q he ee opology and banch lengh we can compue: 5 5 5 5 5 p p p p q T

. Calculae likelihood fo each ie on a pecific ee.. Sum up he L value fo all ie on he ee.. Compae he L value fo all poible ee.. Chooe ee wih highe L value.

Compuing he Tee Likelihood 5 5 T T We ae ineeed in he pobabiliy of obeved daa given ee and banch lengh : Compued by umming ove inenal node Thi can be done efficienly uing a ee upwad aveal pa.

Tee Likelihood Compuaion Define L k a pob. of leave below node k given ha k a Ini: fo leave: L k a if k a ; 0 ohewie Ieaion: if k i node wih childen i and j hen Teminaion:Likelihood i c b j j i i k c L a c b L a b a L a q a L T a oo n

Maimum Likelihood ML Scoe each ee by umpion of independen poiion m Banch lengh can be opimized Gadien cen EM We look fo he highe coing ee Ehauive X X n T [ m] m Sampling mehod Meopoli n [ m] T

Opimal Tee Seach efom each ove poible opologie T T T aamee pace aameic opimizaion EM Local Maima T T n

Compuaional oblem Such pocedue ae compuaionally epenive! Compuaion of opimal paamee pe candidae equie non-ivial opimizaion ep. Spend non-negligible compuaion on a candidae even if i i a low coing one. In pacice uch leaning pocedue can only conide mall e of candidae ucue