Predicting the Evolution of two Genes in the Yeast Saccharomyces Cerevisiae
|
|
- Alvin Horton
- 6 years ago
- Views:
Transcription
1 Available online at wwwsciencedirectcom Procedia Computer Science 11 (01 ) 4 16 Proceedings of the 3rd International Conference on Computational Systems-Biology and Bioinformatics (CSBio 01) Predicting the Evolution of two Genes in the Yeast Saccharomyces Cerevisiae Jacques M Bahi a,c,, Christophe Guyeux a,c,, Antoine Perasso b,c,d, a Institut femto-st b Laboratoire Chrono-Environnement c Université de Franche Comté, France d Authors in alphabetic order Abstract Since the late 60s, various genome evolutionary models have been proposed to predict the evolution of a DNA sequence as the generations pass Essentially, two main categories of such models can be found in the literature The first one, based on nucleotides evolution, uses a mutation matrix of size 4 4 It encompasses for instance the well-known models of Jukes and Cantor, Kimura, and Tamura In the second category, exclusively studied by Bahi and Michel, the evolution of trinucleotides is studied through a matrix of size By essence, all of these models relate the evolution of DNA sequences to the computation of the successive powers of a mutation matrix To make this computation possible, particular forms for the mutation matrix are assumed, which are not compatible with mutation rates that have been recently obtained experimentally on two genes of the Yeast Saccharomyces cerevisiae Using this experimental study, authors of this paper have deduced two simple mutation matrices, compute the future evolution of the rate purine/pyrimidine for two genes of this yeast, investigate the particular behavior of cytosines and thymines compared to purines, and simulate the evolution of each nucleotide for the two genes under interest c 01 The Authors Published by Elsevier BV Open access under CC BY-NC-ND license Selection and/or peer-review under responsibility of the Program Committee of CSBio 01 Keywords: genome evolutionary models, stochastic processes, nucleotides mutations 1 Introduction Codons are not uniformly distributed into the genome Over time mutations have introduced some variations in their frequency of apparition It can be attractive to study the genetic patterns (blocs of more than one nucleotide: dinucleotides, trinucleotides) that appear and disappear depending on mutation parameters Mathematical models allow the prediction of such an evolution, in such a way that statistical values observed into current genomes can be recovered from hypotheses on past DNA sequences Corresponding authors addresses: jacquesbahi@univ-fcomtefr (Jacques M Bahi), christopheguyeux@univ-fcomtefr (Christophe Guyeux), antoineperasso@univ-fcomtefr (Antoine Perasso) Published by Elsevier Ltd doi:101016/jprocs Open access under CC BY-NC-ND license
2 Jacques M Bahi et al / Procedia Computer Science 11 ( 01 ) A first model for genomes evolution has been proposed in 1969 by Thomas Jukes and Charles Cantor [1] This first model is very simple, as it supposes that each nucleotide A, C, G, T has the probability m to mutate to any other nucleotide, as described in the following mutation matrix, m m m m m m m m m m m m In that matrix, the coefficient in row 3, column represents the probability that the nucleotide G mutates in C during the next time interval, ie, P(G C) As diagonal elements can be deduced by the fact that the sum of each row must be equal to 1, they are omitted here This first attempt has been followed up by Motoo Kimura [], who has reasonably considered that transitions (A G and T C) should not have the same mutation rate than transversions (A T, A C, T G, and C G), leading to the following mutation matrix: b a b b b a a b b b a b This model has been refined by Kimura in 1981 (three constant parameters, to make a distinction between natural A T, C G and unnatural transversions), leading to: c a b c b a a b c b a c Joseph Felsenstein [3] has then supposed that the nucleotides frequency depends on the kind of nucleotide A,C,T,G Such a supposition leads to a mutation matrix of the form: π C π G π T π A π G π T π A π C π T π A π C π G with 3π A, 3π C, 3π G, and 3π T denoting respectively the frequency of occurrence of each nucleotide Masami Hasegawa, Hirohisa Kishino, and Taka-Aki Yano [4] have generalized the models of [] and [3], introducing in 1985 the following mutation matrix: απ C βπ G απ T απ A απ G βπ T βπ A απ C απ T απ A βπ C απ G These efforts have been continued by Tamura, who proposed in [5] a simple method to estimate the number of nucleotide substitutions per site between two DNA sequences, by extending the model of Kimura (1980) The idea is to consider a two-parameter method, for the case where a GC bias exists Let us denote by π GC the frequency of this dinucleotide motif Tamura supposes that π G = π C = π GC and π A = π T = 1 π GC, which leads to the following rate matrix: κ(1 π GC )/ (1 π GC )/ (1 π GC )/ κπ GC / π GC / π GC / (1 π GC )/ (1 π GC )/ κ(1 π GC )/ π GC / π GC / κπ GC /
3 6 Jacques M Bahi et al / Procedia Computer Science 11 ( 01 ) 4 16 In the last model of Tamura [6], the two different types of transition (A T, C G) can have a different rate, whereas transversions are all assumed to occur at the same rate (but that rate is allowed to be different from both of the rates for transitions): κ 1 π C π A π G κ 1 π T π A π G π T π C κ π G π T π C κ π A All these models lead to the so-called GTR model [7], in which the mutation matrix has the form (using obvious notations): f AC π C f AG π G f AT π T f AC π A f CG π G f CT π T f AG π A f CG π C π T f AT π A f CT π C π G A second category of models focus on di or trinucleotides evolution From 1990 to 1994, Didier Arquès and Christian Michel have proposed models based on the RN purine/pyrimidine alphabet [8, 9, 10, 11, 1, 13] These models have been abandoned by their own authors in favor of models over the {A, C, G, T} alphabet More precisely, Didier Arquès, Jean-Paul Fallot, and Christian Michel have proposed in 1998 a first evolutionary model on the {A, C, G, T} alphabet that is based on trinucleotides [14] With such a model, the mutation matrix has now a size (there are 64 trinucleotides) In this model, the 3 parameters p, q, r correspond, for a given trinucleotide XYZ, to the probability p of mutation of the first nucleotide X, the mutation probability q of Y, and the probability r that Z mutates As for the nucleotides based models, this new approach has taken into account only constants parameters In 004, Jacques M Bahi and Christian Michel have published a novel research work in which the model of 1998 has been improved by replacing constants parameters by new time dependent parameters [15] By this way, it has been possible to simulate a genes evolution that is non-linear However, the following years, these researchers have been returned to models embedding constant parameters, probably due to the fact that the model of 004 leads to poor results: only one of the twelve studied cases allows to recover values that are close to reality For instance, in 006, Gabriel Frey and Christian Michel have proposed a model that uses 6 constant parameters [16], whereas in 007, Christian Michel has constructed a model with 9 constants parameters that generalizes those of 1998 and 006 [17] Finally, Jacques M Bahi and Christian Michel have recently introduced in [18], a last model with 3 constant parameters, but whose evolution matrix evolves over time In other words, trinucleotides that have to mutate are not fixed, but they are randomly picked among a subset of potentially mutable trinucleotides This model, called chaotic model CM, allows a good recovery of various statistical properties detected into the genome Furthermore, this model matches well with the hypothesis of some primitive genes that have mutated over time The common point of all the models studied by Michel et al is that all their mutation matrices are symmetric They now concentrate their efforts on trinucleotide models and on circular codes discovered in coding sequences Due to mathematical complexity, matrices investigated to model evolution of DNA sequences are thus limited either by the hypothesis of symmetry or by the desire to reduce the number of parameters under consideration These hypotheses allow their authors to solve theoretically the DNA evolution problem by computing directly the successive powers of their mutation matrix However, one can wonder whether such restrictions on the mutation rates are realistic Focusing on this question, authors of the present paper have used a recent research work in which the per-base-pair mutation rates of the Yeast Saccharomyces cerevisiae have been experimentally measured [19] Their results are summarized in Table 1 The mutation matrix of gene ura3 can be deduced from this table It is equal to:
4 Jacques M Bahi et al / Procedia Computer Science 11 ( 01 ) Table 1 Summary of sequenced ura3 and can1 mutations [19] Mutation ura3 T C 4 T A 14 T G 5 C T 16 C A 40 C G 11 A T 8 A C 6 A G 0 G T 8 G C 9 G A 6 Transitions 46 Transversions 11 h 1 m 40m 67 6m 63 14m 3 6m 8m m 11m 16m m 1 m 8m m 5m 1 m 3 3 where m is the mutation rate per generation in ura3 gene, which is equal to /bp/generation, or to /generation for the whole gene [19] Similarly, the mutation matrix for can1 gene is equal to: 1 m 1m 50 40m 7 9m 18 5m 10 1 m 1m 7 4m 18 m 4m m 0m m 0m 7 5m 1 m 18 with m = /bp/generation, or /generation for the whole can1 gene [19] Obviously, none of the existing genomes evolution models can fit such mutation matrix, leading to the fact that hypotheses must be relaxed, even if this relaxation leads to less ambitious models: current models do not match with what really occurs in concrete genomes, at least in the case of this yeast Having these considerations in mind, authors of the present article propose to use the data obtained by Lang and Murray, in order to predict the evolution of the rates or purines and pyrimidines in the two genes studied in [19] A mathematical proof giving the intended limit for these rates when the generations pass, is reinforced by numerical simulations The obtained simulations are thus compared with the historical model of Jukes and Cantor, which is still used by current prediction software A model of size 3 3 with six independent parameters is then proposed and studied in a case that matches with data recorded in [19] Mathematical investigations and numerical simulations focusing on ura3 gene are both given in the case of the yeast Saccharomyces cerevisiae The remainder of this research work is organized as follows In Sections and 3, we focus on the evolution of the gene ura3 Section is dedicated to the formulation of a non symmetric discrete model of size This model translates a genome evolution taking into account purines and pyrimidines mutations A simulation is then,
5 8 Jacques M Bahi et al / Procedia Computer Science 11 ( 01 ) 4 16 performed to compare this non symmetric model to the classical symmetric Cantor model Section 3 deals with a 6-parameters non symmetric model of size 3 3, focusing on the one hand on the evolution of purines and on the other hand of cytosines and thymines This mathematical model is illustrated throughout simulations of the evolution of the purines, cytosines and thymines of gene ura3 We finally conclude this work in Section 4 Non-symmetric Model of size In this section, a first general genome evolution model focusing on purines versus pyrimidines is proposed, to illustrate the method and as a pattern for further investigations This model is applied to the case of the yeast Saccharomyces cerevisiae 1 Theoretical Study Let R and N denote ( respectively ) the occurrence frequency of purines and pyrimidines in a sequence of nucleotides, and M = the associated mutation matrix, with a = P(R R), b = P(R N), c = P(N R), a b c d and d = P(N N) satisfying a + b = 1, (1) c + d = 1, ( ) a 1 a and thus M = c 1 c The initial probability is denoted by P 0 = (R 0 N 0 ), where R 0 and N 0 denote respectively the initial frequency of purines and pyrimidines So the occurrence probability at generation n is P n = P 0 M n, where P n = (R(n) N(n)) is a probability vector such that R(n) (resp N(n)) is the rate of purines (resp pyrimidines) after n generations Determination of M n A division algorithm leads to the existence of a polynomial of degree n, denoted by Q M R n [X], and to a n, b n R such that X n = Q M (X)χ M (X) + a n X + b n, () when χ M is the characteristic polynomial of M Using both the Cayley-Hamilton theorem and the equality given above, we thus have M n = a n M + b n I In order to determine a n and b n, we must find the roots of χ M Asχ M (X) = X Tr(M)X + det(m) and due to (1), we can conclude that 1 is a root of χ M, which thus has two real roots: 1 and x As the roots sum is equal to -tr(a), we conclude that x = a c If x = a c = 1, then a = 1 and c = 0 (as these parameters are in [0, 1]), so the mutation matrix is the identity and the frequencies of purines and pyrimidines into the DNA sequence does not evolve If not, evaluating () in both X = 1 and X = x, we thus obtain 1 = a n + b n, (a c) n = a n (a c) + b n Considering that a c 1, we obtain a n = (a c)n 1 a c 1, b n = a c (a c)n a c 1 Using these last expressions into the equality linking M, a n, and b n, we thus deduce the value of P n = P 0 M n, where ( ) M n 1 (a 1)(a c) = n c (1 a)((a c) n 1)) a c 1 c((a c) n 1) c(a c) n (3) + a 1
6 Jacques M Bahi et al / Procedia Computer Science 11 ( 01 ) Fig 1 Prediction of purine/pyrimidine evolution of ura3 gene in symmetric Cantor model ( ) 0 1 If a = 0 and c = 1, then M =,som 1 0 n is the identity I whereas M n+1 is M Contrarily, if (a, c) {(0, 1); (1, 0)}, then the limit of M n can be easily found using (3), leading to the following result ( ) a 1 a Theorem 1 Consider a DNA sequence under evolution, whose mutation matrix is M = with c 1 c a = P(R R) and c = P(N R) If a = 1, c = 0, then the frequencies of purines and pyrimidines do not change as the generation pass If a = 0, c = 1, then these frequencies oscillate at each generation between (R 0 N 0 ) (even generations) and (N 0 R 0 ) (odd generations) Else the value P n = (R(n) N(n)) of purines and pyrimidines frequencies at generation n is convergent to the following limit: lim P 1 ( ) n = c 1 a n c + 1 a Numerical Application For numerical application, we will consider mutations rates in the ura3 gene of the Yeast Saccharomyces cerevisiae, as obtained by Gregory I Lang and Andrew W Murray [19] As stated before, they have measured phenotypic mutation rates, indicating that the per-base pair mutation rate at ura3 is equal to m = /generation For the majority of Yeasts they studied, ura3 is constituted by 804 bp: 133 cytosines, thymines, 46 adenines, and 14 guanines So R 0 = 057, and N 0 = 048 Using these values in the historical model of Jukes and Cantor [1], we obtain the evolution depicted in Figure 1 Theorem 1 allow us to compute the limit of the rates of purines and pyrimidines: ( ) a = P(N N) = (1 m)+p(a G)+P(G A) The use of Table 1 implies that a = (1 m)+m, ( ) x where x is such that 1 a = P(N R) = m, ie, x = 77, and so a = 1 51m x 77 6
7 10 Jacques M Bahi et al / Procedia Computer Science 11 ( 01 ) 4 16 Fig Prediction of purine/pyrimidine evolution of ura3 gene in non-symmetric Model of size Similarly, c = P(N R) = P(C A) + P(C G) + P(T A) + P(T G) = 70m y, whereas 1 c = 1 m + 0m y Soc = 7m 9 The purine/pyrimidine mutation matrix that corresponds to the data of [19] is thus equal to: 1 51m M = 77 7m 9 51m m 9 Using the value of m for the ura3 gene leads to 1 a = and c = , which can be used in Theorem 1 to conclude that the rate of pyrimidines is convergent to 4599% whereas the rate of purines converge to 54008% Numerical simulations using data published in [19] are given in Figure, leading to a similar conclusion 3 A First Non-Symmetric Genomes Evolution Model of size 3 3 having 6 Parameters In order to investigate the evolution of the frequencies of cytosines and thymines in the gene ura3, a model of size 3 3 compatible with real mutation rates of the yeast Saccharomyces cerevisiae is now presented 31 Formalization Let us consider a line of yeasts where a given gene is sequenced at each generation, in order to clarify explanations The n th generation is obtained at time n, and the rates of purines, cytosines, and tymines at time n are respectively denoted by P R (n), P C (n), and P T (n) Let a be the probability that a purine is changed into a cytosine between two generations, that is: a = P(R C) Similarly, denote by b, c, d, e, f the respective probabilities: P(R T), P(C R), P(C T), P(T R), and P(T C) Contrary to existing approaches, P(R C) is not supposed to be equal to P(C R), and the same statement holds for the other probabilities For the sake of simplicity, we will consider in this first research work that a, b, c, d, e, f are not time dependent 7
8 Jacques M Bahi et al / Procedia Computer Science 11 ( 01 ) Let M = 1 a b a b c 1 c d d e f 1 e f be the mutation matrix associated to the probabilities mentioned above, and P n the vector of occurrence, at time n, of each of the three kind of nucleotides In other words, P n = (P R (n) P C (n) P T (n)) Under that hypothesis, P n is a probability vector: n N, P R (n), P C (n), P T (n) [0, 1], P R (n) + P C (n) + P T (n) = 1, Let P 0 = (P R (0) P C (0) P T (0)) [0, 1] 3 be the initial probability vector We have obviously: P R (n + 1) = P R (n)p(r R) + P C (n)p(c R) + P T (n)p(t R) Similarly, P C (n + 1) = P R (n)p(r C) + P C (n)p(c C) + P T (n)p(t C) and P T (n + 1) = P R (n)p(r T) + P C (n)p(c T) + P T (n)p(t T) This equality yields the following one, P n = P n 1 M = P 0 M n (4) In all that follows we wonder if, given the parameters a, b, c, d, e, f as in [19], one can determine the frequency of occurrence of any of the three kind of nucleotides when n is sufficiently large, in other words if the limit of P n is accessible by computations 3 Resolution The characteristic polynomial of M is equal to χ M (x) = x 3 + (s 3)x + (p s + 3)x 1 + s p = (x 1) ( x + (s )x + (1 s + p) ), where s = a + b + c + d + e + f, p = ad + ae + af + bc + bd + bf + ce + cf + de, det(m) = 1 s + p The discriminant of the polynomial of degree in the factorization of χ M is equal to Δ=(s ) 4(1 s p) = s 4p Let x 1 and x the two roots (potentially complex or equal) of χ M, given by x 1 = s + s 4p and x = s + + s 4p (5) Let n N, n As χ M is a polynomial of degree, a division algorithm of X n by χ M (X) leads to the existence and uniqueness of two polynomials Q n and R n, such that X n = Q n (X)χ (X) + R n (X), (6) where the degree of R n is lower than or equal to the degree of χ M, ie, R n (X) = a n X + b n X + c n with a n, b n, c n R for every n N By evaluating (6) in the three roots of χ M, we find the system 1 = a n + b n + c n x1 n = a n x1 + b nx 1 + c n = a n x + b nx + c n x n
9 1 Jacques M Bahi et al / Procedia Computer Science 11 ( 01 ) 4 16 This system is equivalent to c n + b n + a n = 1 b n (x 1 1) + a n (x 1 1) = xn 1 1 b n (x 1) + a n (x 1) = xn 1 For the ura3 gene, it is easy to check that x 1 1, x 1, and x 1 x (see numerical applications of Section 34) Then standard algebraic computations give [ 1 x n a n = 1 x x 1 x 1 xn 1 1 ], x 1 1 b n = x x n 1 x 1 x x 1 + x + 1 x1 n 1 x x 1 x 1 1, c n = 1 a n b n Using for i = 1, and n N the following notation, and since x x 1 = Δ, the system above can be rewritten as a n = X (n) X 1 (n), Δ X i (n) = xn i 1 x i 1, (7) b n = (x + 1)X 1 (n) (x 1 + 1)X (n) Δ, (8) c n = 1 + x 1X (n) x X 1 (n) Δ By evaluating (6) in M and due to the theorem of Cayley-Hamilton, we finally have for every integer n 1, M n = a n M + b n M + c n I 3, (9) where I 3 is the identity matrix of size 3, a n, b n, and c n are given by (8), and M is given by a + ab + ac a a ab ac ab + ad b +b + be b + 1 ad + a + bf be bf + b M ac bc c = ac + c + cd c bc cd d cd + c + de +d + df d + 1 de df + d ae be + cf ae cf df be + df + e + ef e ef + e ef f + f e + f f Convergence study In the case of ura3, x 1 < 1 and x < 1 (see the next section) Then X i (n) 1 for i = 1, and so 1 x i a n 1 ( ) 1 1 Δ 1 x 1 x 1 Denote by a this limit We have a = x x 1 Δ(1 x )(1 x 1 ) = 1 (1 x )(1 x 1 ) = 1 s + Δ s Δ,
10 Jacques M Bahi et al / Procedia Computer Science 11 ( 01 ) and finally Similarly, b n = X 1 (n) a n (x 1 + 1) satisfies a = 4 s Δ = 1 p b n 1 x x 1 p The following computations finally yield So 1 1 x 1 = and to sum up, the distribution limit is given by s + Δ = (s Δ) s Δ = s Δ, p x p = s + 4 Δ, p b = s p c n 1 a b = p s + 1, p a = 1 p b = s p c = p s + 1 p (10) Using the latter values in (9), we can determine the limit of M n, which is a M + b M + c I 3 All computations done, we find the following limit for M n, 1 p bf + df ce + cf + de bf + df ae+ af + bf ad+ bc + bd ce + cf + de ae + af + df ad+ bc + bd ce + cf + de ae + af + bf ad+ bc + bd bf + df Using (4), we can thus finally determine the limit of P n = P 0 M n = (P R (0) P C (0) P T (0))M n, which leads to the following result Theorem 31 The frequencies P R (n), P C (n), and P T (n) of occurrence at time n of purines, cytosines, and thymines in the considered gene ura3 of the yeast Saccharomyces cerevisiae converge to the following values: P R (n) ce + cf + de + (df bf)p R(0) p bf + df P C (n) ae + af + df + (df bf)p C(0) p bf + df P T (n) ad + bc + bd + (df bf)p T (0) p bf + df
11 14 Jacques M Bahi et al / Procedia Computer Science 11 ( 01 ) 4 16 Fig 3 Prediction of evolution concerning the purine, thymine, and cytosine rates in ura3 Non-symmetric Model of size Numerical Application and Simulations We consider another time the numerical values for mutations published in [19] (concerning the ura3 gene of the Yeast Saccharomyces cerevisiae) ura3 has a mutation rate of /bp/generation [19] As this gene is constituted by 804 nucleotides, we can deduce that its global mutation rate per generation is equal to m = = Let us compute the values of a, b, c, d, e, and f The first line of the mutation matrix is constituted by 1 a b = P(R R), a = P(R T), and b = P(R C) P(R R) takes into account the fact that a purine can either be preserved (no mutation, probability 1 m), or mutate into another purine (A G, G A) As the generations pass, authors of [19] have counted 0 mutations of kind A G, and 6 mutations of kind G A Similarly, there were 8 mutations G T and 8: A T, so 36: R T Finally, 6: A C and 9: G C lead to 15: R C mutations The total of mutations to consider when evaluating the first line is so equal to 77 All these considerations lead to the fact that 1 a b = (1 m) + m 6 77, a = 36m 77, and b = 15m 19m A similar reasoning leads to c = 77 3, d = 4m 3, e = 51m 16m, and f = In that situation, s = a + b + c + d + e + f = 05m , and p = 07488m So Δ=s 4p = 8541m > 0, x 1 = 1 m , and x = 1 m As x [0, 1] and x [0, 1], we have, due to Theorem 31: P R (n) ce + cf + de + (df bf)p R(0) p bf + df P C (n) ae + af + df + (df bf)p C(0) p bf + df P T (n) ad + bc + bd + (df bf)p T (0) p bf + df Using the data of [19], we find that P R (0) = , P C(0) = , and P T (0) = So P R (n) 0549, P C (n) 09, and P T (n) 0159 Simulations corresponding to this example are given in Fig 3
12 Jacques M Bahi et al / Procedia Computer Science 11 ( 01 ) Conclusion In this document, the possible evolution of gene ura3 of the yeast Saccharomyces cerevisiae has been studied As current models of nucleotides cannot fit the mutations obtained experimentally by Lang and Murray [19], authors of this paper have introduced two new simple models to predict the evolution of this gene On the one hand, a formulation of a non symmetric discrete model of size has been proposed, which studies a DNA evolution taking into account purines and pyrimidines mutation rates A simulation has been performed, to compare the proposal to the well known Jukes and Cantor model On the other hand, a 6-parameters non symmetric model of size 3 3 has been introduced and tested with numerical simulations, to make a distinction between cytosines and thymines in the former proposal These two models still remain generic, and can be adapted to a large panel of applications, replacing either the couple (purines, pyrimidines) or the tuple (purines, cytosines, thymines) by any categories of interest The ura3 gene is not the unique example of a DNA sequence of interest such that none of the existing nucleotides evolution models cannot be applied due to a complex mutation matrix For instance, a second gene called can1 has been studied too by the authors of [19] Their measures are reproduced in Table Obviously, usual models cannot be used to predict the evolution of this gene, whereas a study following a same canvas than what has been proposed in this research work can be realized In future work, the authors intention is to make a complete mathematical study of the 6-parameters non symmetric model of size 3 3 proposed in this document, and to apply it to various case studies Biological consequences of the results produces by this model will be systematically investigated Then, the most general non symmetric model of size 4 will be regarded in some particular cases taken from biological case studies, and the possibility of mutations non uniformly distributed will then be investigated Table Summary of sequenced can1 mutations [19] Mutation can1 T C 4 T A 9 T G 5 C T 0 C A 1 C G 9 A T 4 A C 5 A G 1 G T 0 G C 1 G A 40 Transitions 65 Transversions 85 References [1] T H Jukes, C R Cantor, Evolution of Protein Molecules, Academy Press, 1969 [] M Kimura, A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences, Journal of Molecular Evolution 16 (1980) , /BF URL [3] J Felsenstein, A view of population genetics, Science 08 (4449) (1980) 153 doi:10116/science URL [4] M Hasegawa, H Kishino, T Yano, Dating of the human-ape splitting by a molecular clock of mitochondrial dna, J Mol Evol () (1985) [5] K Tamura, Estimation of the number of nucleotide substitutions when there are strong transition-transversion and g+c-content biases, Molecular Biology and Evolution 9 (4) (199) arxiv: URL
13 16 Jacques M Bahi et al / Procedia Computer Science 11 ( 01 ) 4 16 [6] K Tamura, M Nei, Estimation of the number of nucleotide substitutions in the control region of mitochondrial dna in humans and chimpanzees, Molecular Biology and Evolution 10 (3) (1993) arxiv: URL [7] Z Yang, Estimating the pattern of nucleotide substitution, Journal of Molecular Evolution 10 (1994) [8] D G Arquès, C J Michel, Periodicities in coding and noncoding regions of the genes, J Theor Biol 143 (3) (1990) [9] D G Arquès, C J Michel, A model of dna sequence evolution, Bull Math Biol 5 (6) (1990) [10] D G Arquès, C J Michel, A simulation of the genetic periodicities modulo and 3 with processes of nucleotide insertions and deletions, J Theor Biol 156 (1) (199) [11] D G Arquès, C J Michel, K Orieux, Identification and simulation of new non-random statistical properties common to different populations of eukaryotic non-coding genes, J Theor Biol 161 (3) (1993) doi:101006/jtbi URL [1] D G Arquès, C J Michel, Identification and simulation of new non-random statistical properties common to different eukaryotic gene subpopulations, Biochimie 75 (5) (1993) [13] D G Arquès, C J Michel, Analytical expression of the purine/pyrimidine autocorrelation function after and before random mutations, Math Biosci 13 (1) (1994) [14] D G Arquès, J P Fallot, C J Michel, An evolutionary analytical model of a complementary circular code simulating the protein coding genes, the 5 and 3 regions, Bull Math Biol 60 (1) (1998) doi:101006/bulm URL [15] J M Bahi, C J Michel, A stochastic gene evolution model with time dependent mutations, Bull Math Biol 66 (4) (004) doi:101016/jbulm URL [16] G Frey, C J Michel, An analytical model of gene evolution with six mutation parameters: an application to archaeal circular codes, Comput Biol Chem 30 (1) (006) 1 11 doi:101016/jcompbiolchem URL [17] C J Michel, An analytical model of gene evolution with 9 mutation parameters: an application to the amino acids coded by the common circular code, Bull Math Biol 69 () (007) doi:101007/s z URL [18] J M Bahi, C Guyeux, Chaotic iterations and topological chaosarxiv:arxiv: URL arxiv: [19] G I Lang, A W Murray, Estimating the per-base-pair mutation rate in the yeast saccharomyces cerevisiae, Genetics 178 (1) (January 008) 67 8 arxiv: doi:101534/genetics URL
Relaxing the Hypotheses of Symmetry and Time-Reversibility in Genome Evolutionary Models
Relaxing the Hypotheses of Symmetry and Time-Reversibility in Genome Evolutionary Models Jacques M. Bahi, Christophe Guyeux, Antoine Perasso To cite this version: Jacques M. Bahi, Christophe Guyeux, Antoine
Computational Biology and Chemistry
Computational Biology and Chemistry 33 (2009) 245 252 Contents lists available at ScienceDirect Computational Biology and Chemistry journal homepage: www.elsevier.com/locate/compbiolchem Research Article
Lecture 24. Phylogeny methods, part 4 (Models of DNA and protein change) p.1/22
Lecture 24. Phylogeny methods, part 4 (Models of DNA and protein change) Joe Felsenstein Department of Genome Sciences and Department of Biology Lecture 24. Phylogeny methods, part 4 (Models of DNA and
Lecture 27. Phylogeny methods, part 4 (Models of DNA and protein change) p.1/26
Lecture 27. Phylogeny methods, part 4 (Models of DNA and protein change) Joe Felsenstein Department of Genome Sciences and Department of Biology Lecture 27. Phylogeny methods, part 4 (Models of DNA and
Lecture Notes: Markov chains
Computational Genomics and Molecular Biology, Fall 5 Lecture Notes: Markov chains Dannie Durand At the beginning of the semester, we introduced two simple scoring functions for pairwise alignments: a similarity
Prof. Christian MICHEL
CIRCULAR CODES IN GENES AND GENOMES - 2013 - Prof. Christian MICHEL Theoretical Bioinformatics ICube University of Strasbourg, CNRS France c.michel@unistra.fr http://dpt-info.u-strasbg.fr/~c.michel/ Prof.
Lecture 4. Models of DNA and protein change. Likelihood methods
Lecture 4. Models of DNA and protein change. Likelihood methods Joe Felsenstein Department of Genome Sciences and Department of Biology Lecture 4. Models of DNA and protein change. Likelihood methods p.1/36
Lecture 4: Evolutionary Models and Substitution Matrices (PAM and BLOSUM)
Bioinformatics II Probability and Statistics Universität Zürich and ETH Zürich Spring Semester 2009 Lecture 4: Evolutionary Models and Substitution Matrices (PAM and BLOSUM) Dr Fraser Daly adapted from
MATHEMATICAL MODELS - Vol. III - Mathematical Modeling and the Human Genome - Hilary S. Booth MATHEMATICAL MODELING AND THE HUMAN GENOME
MATHEMATICAL MODELING AND THE HUMAN GENOME Hilary S. Booth Australian National University, Australia Keywords: Human genome, DNA, bioinformatics, sequence analysis, evolution. Contents 1. Introduction:
Massachusetts Institute of Technology Computational Evolutionary Biology, Fall, 2005 Notes for November 7: Molecular evolution
Massachusetts Institute of Technology 6.877 Computational Evolutionary Biology, Fall, 2005 Notes for November 7: Molecular evolution 1. Rates of amino acid replacement The initial motivation for the neutral
Lecture 4: Evolutionary models and substitution matrices (PAM and BLOSUM).
1 Bioinformatics: In-depth PROBABILITY & STATISTICS Spring Semester 2011 University of Zürich and ETH Zürich Lecture 4: Evolutionary models and substitution matrices (PAM and BLOSUM). Dr. Stefanie Muff
How should we go about modeling this? Model parameters? Time Substitution rate Can we observe time or subst. rate? What can we observe?
How should we go about modeling this? gorilla GAAGTCCTTGAGAAATAAACTGCACACACTGG orangutan GGACTCCTTGAGAAATAAACTGCACACACTGG Model parameters? Time Substitution rate Can we observe time or subst. rate? What
What Is Conservation?
What Is Conservation? Lee A. Newberg February 22, 2005 A Central Dogma Junk DNA mutates at a background rate, but functional DNA exhibits conservation. Today s Question What is this conservation? Lee A.
Mutation models I: basic nucleotide sequence mutation models
Mutation models I: basic nucleotide sequence mutation models Peter Beerli September 3, 009 Mutations are irreversible changes in the DNA. This changes may be introduced by chance, by chemical agents, or
Modeling Noise in Genetic Sequences
Modeling Noise in Genetic Sequences M. Radavičius 1 and T. Rekašius 2 1 Institute of Mathematics and Informatics, Vilnius, Lithuania 2 Vilnius Gediminas Technical University, Vilnius, Lithuania 1. Introduction:
Lie Markov models. Jeremy Sumner. School of Physical Sciences University of Tasmania, Australia
Lie Markov models Jeremy Sumner School of Physical Sciences University of Tasmania, Australia Stochastic Modelling Meets Phylogenetics, UTAS, November 2015 Jeremy Sumner Lie Markov models 1 / 23 The theory
Understanding relationship between homologous sequences
Molecular Evolution Molecular Evolution How and when were genes and proteins created? How old is a gene? How can we calculate the age of a gene? How did the gene evolve to the present form? What selective
Taming the Beast Workshop
Workshop David Rasmussen & arsten Magnus June 27, 2016 1 / 31 Outline of sequence evolution: rate matrices Markov chain model Variable rates amongst different sites: +Γ Implementation in BES2 2 / 31 genotype
Lecture 4. Models of DNA and protein change. Likelihood methods
Lecture 4. Models of DNA and protein change. Likelihood methods Joe Felsenstein Department of Genome Sciences and Department of Biology Lecture 4. Models of DNA and protein change. Likelihood methods p.1/39
EVOLUTIONARY DISTANCE MODEL BASED ON DIFFERENTIAL EQUATION AND MARKOV PROCESS
August 0 Vol 4 No 005-0 JATIT & LLS All rights reserved ISSN: 99-8645 wwwjatitorg E-ISSN: 87-95 EVOLUTIONAY DISTANCE MODEL BASED ON DIFFEENTIAL EUATION AND MAKOV OCESS XIAOFENG WANG College of Mathematical
Phylogeny Estimation and Hypothesis Testing using Maximum Likelihood
Phylogeny Estimation and Hypothesis Testing using Maximum Likelihood For: Prof. Partensky Group: Jimin zhu Rama Sharma Sravanthi Polsani Xin Gong Shlomit klopman April. 7. 2003 Table of Contents Introduction...3
Eigenvalues and Eigenvectors: An Introduction
Eigenvalues and Eigenvectors: An Introduction The eigenvalue problem is a problem of considerable theoretical interest and wide-ranging application. For example, this problem is crucial in solving systems
Substitution = Mutation followed. by Fixation. Common Ancestor ACGATC 1:A G 2:C A GAGATC 3:G A 6:C T 5:T C 4:A C GAAATT 1:G A
GAGATC 3:G A 6:C T Common Ancestor ACGATC 1:A G 2:C A Substitution = Mutation followed 5:T C by Fixation GAAATT 4:A C 1:G A AAAATT GAAATT GAGCTC ACGACC Chimp Human Gorilla Gibbon AAAATT GAAATT GAGCTC ACGACC
The Phylo- HMM approach to problems in comparative genomics, with examples.
The Phylo- HMM approach to problems in comparative genomics, with examples. Keith Bettinger Introduction The theory of evolution explains the diversity of organisms on Earth by positing that earlier species
Evolutionary Analysis of Viral Genomes
University of Oxford, Department of Zoology Evolutionary Biology Group Department of Zoology University of Oxford South Parks Road Oxford OX1 3PS, U.K. Fax: +44 1865 271249 Evolutionary Analysis of Viral
How Molecules Evolve. Advantages of Molecular Data for Tree Building. Advantages of Molecular Data for Tree Building
How Molecules Evolve Guest Lecture: Principles and Methods of Systematic Biology 11 November 2013 Chris Simon Approaching phylogenetics from the point of view of the data Understanding how sequences evolve
Bio 1B Lecture Outline (please print and bring along) Fall, 2007
Bio 1B Lecture Outline (please print and bring along) Fall, 2007 B.D. Mishler, Dept. of Integrative Biology 2-6810, bmishler@berkeley.edu Evolution lecture #5 -- Molecular genetics and molecular evolution
Maximum Likelihood Until recently the newest method. Popularized by Joseph Felsenstein, Seattle, Washington.
Maximum Likelihood This presentation is based almost entirely on Peter G. Fosters - "The Idiot s Guide to the Zen of Likelihood in a Nutshell in Seven Days for Dummies, Unleashed. http://www.bioinf.org/molsys/data/idiots.pdf
7. Tests for selection
Sequence analysis and genomics 7. Tests for selection Dr. Katja Nowick Group leader TFome and Transcriptome Evolution Bioinformatics group Paul-Flechsig-Institute for Brain Research www. nowicklab.info
Amira A. AL-Hosary PhD of infectious diseases Department of Animal Medicine (Infectious Diseases) Faculty of Veterinary Medicine Assiut
Amira A. AL-Hosary PhD of infectious diseases Department of Animal Medicine (Infectious Diseases) Faculty of Veterinary Medicine Assiut University-Egypt Phylogenetic analysis Phylogenetic Basics: Biological
Letter to the Editor. Department of Biology, Arizona State University
Letter to the Editor Traditional Phylogenetic Reconstruction Methods Reconstruct Shallow and Deep Evolutionary Relationships Equally Well Michael S. Rosenberg and Sudhir Kumar Department of Biology, Arizona
2. What was the Avery-MacLeod-McCarty experiment and why was it significant? 3. What was the Hershey-Chase experiment and why was it significant?
Name Date Period AP Exam Review Part 6: Molecular Genetics I. DNA and RNA Basics A. History of finding out what DNA really is 1. What was Griffith s experiment and why was it significant? 1 2. What was
Phylogenetic Tree Reconstruction
I519 Introduction to Bioinformatics, 2011 Phylogenetic Tree Reconstruction Yuzhen Ye (yye@indiana.edu) School of Informatics & Computing, IUB Evolution theory Speciation Evolution of new organisms is driven
Stochastic Errors vs. Modeling Errors in Distance Based Phylogenetic Reconstructions
PLGW05 Stochastic Errors vs. Modeling Errors in Distance Based Phylogenetic Reconstructions 1 joint work with Ilan Gronau 2, Shlomo Moran 3, and Irad Yavneh 3 1 2 Dept. of Biological Statistics and Computational
"Nothing in biology makes sense except in the light of evolution Theodosius Dobzhansky
MOLECULAR PHYLOGENY "Nothing in biology makes sense except in the light of evolution Theodosius Dobzhansky EVOLUTION - theory that groups of organisms change over time so that descendeants differ structurally
Maximum Likelihood Tree Estimation. Carrie Tribble IB Feb 2018
Maximum Likelihood Tree Estimation Carrie Tribble IB 200 9 Feb 2018 Outline 1. Tree building process under maximum likelihood 2. Key differences between maximum likelihood and parsimony 3. Some fancy extras
Phylogenetic Assumptions
Substitution Models and the Phylogenetic Assumptions Vivek Jayaswal Lars S. Jermiin COMMONWEALTH OF AUSTRALIA Copyright htregulation WARNING This material has been reproduced and communicated to you by
Simulation of the Evolution of Information Content in Transcription Factor Binding Sites Using a Parallelized Genetic Algorithm
Simulation of the Evolution of Information Content in Transcription Factor Binding Sites Using a Parallelized Genetic Algorithm Joseph Cornish*, Robert Forder**, Ivan Erill*, Matthias K. Gobbert** *Department
(Lys), resulting in translation of a polypeptide without the Lys amino acid. resulting in translation of a polypeptide without the Lys amino acid.
1. A change that makes a polypeptide defective has been discovered in its amino acid sequence. The normal and defective amino acid sequences are shown below. Researchers are attempting to reproduce the
Likelihood Ratio Tests for Detecting Positive Selection and Application to Primate Lysozyme Evolution
Likelihood Ratio Tests for Detecting Positive Selection and Application to Primate Lysozyme Evolution Ziheng Yang Department of Biology, University College, London An excess of nonsynonymous substitutions
Dr. Amira A. AL-Hosary
Phylogenetic analysis Amira A. AL-Hosary PhD of infectious diseases Department of Animal Medicine (Infectious Diseases) Faculty of Veterinary Medicine Assiut University-Egypt Phylogenetic Basics: Biological
Preliminaries. Download PAUP* from: Tuesday, July 19, 16
Preliminaries Download PAUP* from: http://people.sc.fsu.edu/~dswofford/paup_test 1 A model of the Boston T System 1 Idea from Paul Lewis A simpler model? 2 Why do models matter? Model-based methods including
Phylogenetics: Distance Methods. COMP Spring 2015 Luay Nakhleh, Rice University
Phylogenetics: Distance Methods COMP 571 - Spring 2015 Luay Nakhleh, Rice University Outline Evolutionary models and distance corrections Distance-based methods Evolutionary Models and Distance Correction
Markov Models & DNA Sequence Evolution
7.91 / 7.36 / BE.490 Lecture #5 Mar. 9, 2004 Markov Models & DNA Sequence Evolution Chris Burge Review of Markov & HMM Models for DNA Markov Models for splice sites Hidden Markov Models - looking under
Supplementary Information for Hurst et al.: Causes of trends of amino acid gain and loss
Supplementary Information for Hurst et al.: Causes of trends of amino acid gain and loss Methods Identification of orthologues, alignment and evolutionary distances A preliminary set of orthologues was
Computational Biology: Basics & Interesting Problems
Computational Biology: Basics & Interesting Problems Summary Sources of information Biological concepts: structure & terminology Sequencing Gene finding Protein structure prediction Sources of information
Week 5: Distance methods, DNA and protein models
Week 5: Distance methods, DNA and protein models Genome 570 February, 2016 Week 5: Distance methods, DNA and protein models p.1/69 A tree and the expected distances it predicts E A 0.08 0.05 0.06 0.03
Phylogenetic inference
Phylogenetic inference Bas E. Dutilh Systems Biology: Bioinformatic Data Analysis Utrecht University, March 7 th 016 After this lecture, you can discuss (dis-) advantages of different information types
Phylogenetics. BIOL 7711 Computational Bioscience
Consortium for Comparative Genomics! University of Colorado School of Medicine Phylogenetics BIOL 7711 Computational Bioscience Biochemistry and Molecular Genetics Computational Bioscience Program Consortium
Quantifying sequence similarity
Quantifying sequence similarity Bas E. Dutilh Systems Biology: Bioinformatic Data Analysis Utrecht University, February 16 th 2016 After this lecture, you can define homology, similarity, and identity
Motivating the need for optimal sequence alignments...
1 Motivating the need for optimal sequence alignments... 2 3 Note that this actually combines two objectives of optimal sequence alignments: (i) use the score of the alignment o infer homology; (ii) use
Some of these slides have been borrowed from Dr. Paul Lewis, Dr. Joe Felsenstein. Thanks!
Some of these slides have been borrowed from Dr. Paul Lewis, Dr. Joe Felsenstein. Thanks! Paul has many great tools for teaching phylogenetics at his web site: http://hydrodictyon.eeb.uconn.edu/people/plewis
Additive distances. w(e), where P ij is the path in T from i to j. Then the matrix [D ij ] is said to be additive.
Additive distances Let T be a tree on leaf set S and let w : E R + be an edge-weighting of T, and assume T has no nodes of degree two. Let D ij = e P ij w(e), where P ij is the path in T from i to j. Then
MATH c UNIVERSITY OF LEEDS Examination for the Module MATH2210 (May/June 2004) INTRODUCTION TO DISCRETE MATHEMATICS. Time allowed : 2 hours
This question paper consists of 5 printed pages, each of which is identified by the reference MATH221001 MATH221001 No calculators allowed c UNIVERSITY OF LEEDS Examination for the Module MATH2210 (May/June
Sequence Analysis 17: lecture 5. Substitution matrices Multiple sequence alignment
Sequence Analysis 17: lecture 5 Substitution matrices Multiple sequence alignment Substitution matrices Used to score aligned positions, usually of amino acids. Expressed as the log-likelihood ratio of
Inferring Molecular Phylogeny
Dr. Walter Salzburger he tree of life, ustav Klimt (1907) Inferring Molecular Phylogeny Inferring Molecular Phylogeny 55 Maximum Parsimony (MP): objections long branches I!! B D long branch attraction
EVOLUTIONARY DISTANCES
EVOLUTIONARY DISTANCES FROM STRINGS TO TREES Luca Bortolussi 1 1 Dipartimento di Matematica ed Informatica Università degli studi di Trieste luca@dmi.units.it Trieste, 14 th November 2007 OUTLINE 1 STRINGS:
KaKs Calculator: Calculating Ka and Ks Through Model Selection and Model Averaging
Method KaKs Calculator: Calculating Ka and Ks Through Model Selection and Model Averaging Zhang Zhang 1,2,3#, Jun Li 2#, Xiao-Qian Zhao 2,3, Jun Wang 1,2,4, Gane Ka-Shu Wong 2,4,5, and Jun Yu 1,2,4 * 1
Lecture 27. Phylogeny methods, part 7 (Bootstraps, etc.) p.1/30
Lecture 27. Phylogeny methods, part 7 (Bootstraps, etc.) Joe Felsenstein Department of Genome Sciences and Department of Biology Lecture 27. Phylogeny methods, part 7 (Bootstraps, etc.) p.1/30 A non-phylogeny
Using phylogenetics to estimate species divergence times... Basics and basic issues for Bayesian inference of divergence times (plus some digression)
Using phylogenetics to estimate species divergence times... More accurately... Basics and basic issues for Bayesian inference of divergence times (plus some digression) "A comparison of the structures
RELATING PHYSICOCHEMMICAL PROPERTIES OF AMINO ACIDS TO VARIABLE NUCLEOTIDE SUBSTITUTION PATTERNS AMONG SITES ZIHENG YANG
RELATING PHYSICOCHEMMICAL PROPERTIES OF AMINO ACIDS TO VARIABLE NUCLEOTIDE SUBSTITUTION PATTERNS AMONG SITES ZIHENG YANG Department of Biology (Galton Laboratory), University College London, 4 Stephenson
Lab 9: Maximum Likelihood and Modeltest
Integrative Biology 200A University of California, Berkeley "PRINCIPLES OF PHYLOGENETICS" Spring 2010 Updated by Nick Matzke Lab 9: Maximum Likelihood and Modeltest In this lab we re going to use PAUP*
Position-specific scoring matrices (PSSM)
Regulatory Sequence nalysis Position-specific scoring matrices (PSSM) Jacques van Helden Jacques.van-Helden@univ-amu.fr Université d ix-marseille, France Technological dvances for Genomics and Clinics
Bioinformatics 1. Sepp Hochreiter. Biology, Sequences, Phylogenetics Part 4. Bioinformatics 1: Biology, Sequences, Phylogenetics
Bioinformatics 1 Biology, Sequences, Phylogenetics Part 4 Sepp Hochreiter Klausur Mo. 30.01.2011 Zeit: 15:30 17:00 Raum: HS14 Anmeldung Kusss Contents Methods and Bootstrapping of Maximum Methods Methods
Some of these slides have been borrowed from Dr. Paul Lewis, Dr. Joe Felsenstein. Thanks!
Some of these slides have been borrowed from Dr. Paul Lewis, Dr. Joe Felsenstein. Thanks! Paul has many great tools for teaching phylogenetics at his web site: http://hydrodictyon.eeb.uconn.edu/people/plewis
Efficiencies of maximum likelihood methods of phylogenetic inferences when different substitution models are used
Molecular Phylogenetics and Evolution 31 (2004) 865 873 MOLECULAR PHYLOGENETICS AND EVOLUTION www.elsevier.com/locate/ympev Efficiencies of maximum likelihood methods of phylogenetic inferences when different
Videos. Bozeman, transcription and translation: https://youtu.be/h3b9arupxzg Crashcourse: Transcription and Translation - https://youtu.
Translation Translation Videos Bozeman, transcription and translation: https://youtu.be/h3b9arupxzg Crashcourse: Transcription and Translation - https://youtu.be/itsb2sqr-r0 Translation Translation The
Biology 2018 Final Review. Miller and Levine
Biology 2018 Final Review Miller and Levine bones blood cells elements All living things are made up of. cells If a cell of an organism contains a nucleus, the organism is a(n). eukaryote prokaryote plant
Phylogenetics. Andreas Bernauer, March 28, Expected number of substitutions using matrix algebra 2
Phylogenetics Andreas Bernauer, andreas@carrot.mcb.uconn.edu March 28, 2004 Contents 1 ts:tr rate ratio vs. ts:tr ratio 1 2 Expected number of substitutions using matrix algebra 2 3 Why the GTR model can
ON THE COMPLETENESS OF GENETIC CODE: SOME NEW EXAMPLES
ON THE COMPLETENESS OF GENETIC CODE: SOME NEW EXAMPLES Miloje M. Rakočević Department of Chemistry, Faculty of Science, University of Nish, Serbia (E-mail: milemirkov@open.telekom.rs; www.rakocevcode.rs)
Endowed with an Extra Sense : Mathematics and Evolution
Endowed with an Extra Sense : Mathematics and Evolution Todd Parsons Laboratoire de Probabilités et Modèles Aléatoires - Université Pierre et Marie Curie Center for Interdisciplinary Research in Biology
Chapters 12&13 Notes: DNA, RNA & Protein Synthesis
Chapters 12&13 Notes: DNA, RNA & Protein Synthesis Name Period Words to Know: nucleotides, DNA, complementary base pairing, replication, genes, proteins, mrna, rrna, trna, transcription, translation, codon,
Using algebraic geometry for phylogenetic reconstruction
Using algebraic geometry for phylogenetic reconstruction Marta Casanellas i Rius (joint work with Jesús Fernández-Sánchez) Departament de Matemàtica Aplicada I Universitat Politècnica de Catalunya IMA
Phylogeny and systematics. Why are these disciplines important in evolutionary biology and how are they related to each other?
Phylogeny and systematics Why are these disciplines important in evolutionary biology and how are they related to each other? Phylogeny and systematics Phylogeny: the evolutionary history of a species
Concepts and Methods in Molecular Divergence Time Estimation
Concepts and Methods in Molecular Divergence Time Estimation 26 November 2012 Prashant P. Sharma American Museum of Natural History Overview 1. Why do we date trees? 2. The molecular clock 3. Local clocks
2. The following molecules are considered polymers except Mark all that apply a. Starch b. DNA c. Proteins d. Lipids e. Salt
Life s Major Molecules 1. Which is an organic molecule? a. Ne b. O2 c. CH4 d. NaCl e. H2O 2. The following molecules are considered polymers except Mark all that apply a. Starch b. DNA c. Proteins d. Lipids
Supporting Information
Supporting Information Weghorn and Lässig 10.1073/pnas.1210887110 SI Text Null Distributions of Nucleosome Affinity and of Regulatory Site Content. Our inference of selection is based on a comparison of
Nucleotide Frequencies in Human Genome and Fibonacci Numbers
arxiv:q-bio/0611041v1 [q-bio.ot] 13 Nov 2006 Nucleotide Frequencies in Human Genome and Fibonacci Numbers Michel E. Beleza Yamagishi Embrapa Informática /UNISAL February 9, 2008 Abstract Alex Itiro Shimabukuro
7.36/7.91 recitation CB Lecture #4
7.36/7.91 recitation 2-19-2014 CB Lecture #4 1 Announcements / Reminders Homework: - PS#1 due Feb. 20th at noon. - Late policy: ½ credit if received within 24 hrs of due date, otherwise no credit - Answer
Lecture Notes: BIOL2007 Molecular Evolution
Lecture Notes: BIOL2007 Molecular Evolution Kanchon Dasmahapatra (k.dasmahapatra@ucl.ac.uk) Introduction By now we all are familiar and understand, or think we understand, how evolution works on traits
ON THE COMPLETENESS OF GENETIC CODE: PART V. Miloje M. Rakočević
ON THE OMPLETENESS OF ENETI ODE: PRT V Miloje M. Rakočević Department of hemistry, Faculty of Science, niversity of Nish, Serbia (E-mail: milemirkov@open.telekom.rs; www.rakocevcode.rs) bstract. In this
How much non-coding DNA do eukaryotes require?
How much non-coding DNA do eukaryotes require? Andrei Zinovyev UMR U900 Computational Systems Biology of Cancer Institute Curie/INSERM/Ecole de Mine Paritech Dr. Sebastian Ahnert Dr. Thomas Fink Bioinformatics
Regulatory Sequence Analysis. Sequence models (Bernoulli and Markov models)
Regulatory Sequence Analysis Sequence models (Bernoulli and Markov models) 1 Why do we need random models? Any pattern discovery relies on an underlying model to estimate the random expectation. This model
The genome encodes biology as patterns or motifs. We search the genome for biologically important patterns.
Curriculum, fourth lecture: Niels Richard Hansen November 30, 2011 NRH: Handout pages 1-8 (NRH: Sections 2.1-2.5) Keywords: binomial distribution, dice games, discrete probability distributions, geometric
Biological Systems: Open Access
Biological Systems: Open Access Biological Systems: Open Access Liu and Zheng, 2016, 5:1 http://dx.doi.org/10.4172/2329-6577.1000153 ISSN: 2329-6577 Research Article ariant Maps to Identify Coding and
Objective 3.01 (DNA, RNA and Protein Synthesis)
Objective 3.01 (DNA, RNA and Protein Synthesis) DNA Structure o Discovered by Watson and Crick o Double-stranded o Shape is a double helix (twisted ladder) o Made of chains of nucleotides: o Has four types
Nucleotide substitution models
Nucleotide substitution models Alexander Churbanov University of Wyoming, Laramie Nucleotide substitution models p. 1/23 Jukes and Cantor s model [1] The simples symmetrical model of DNA evolution All
Formalizing the gene centered view of evolution
Chapter 1 Formalizing the gene centered view of evolution Yaneer Bar-Yam and Hiroki Sayama New England Complex Systems Institute 24 Mt. Auburn St., Cambridge, MA 02138, USA yaneer@necsi.org / sayama@necsi.org
A Multiobjective GO based Approach to Protein Complex Detection
Available online at www.sciencedirect.com Procedia Technology 4 (2012 ) 555 560 C3IT-2012 A Multiobjective GO based Approach to Protein Complex Detection Sumanta Ray a, Moumita De b, Anirban Mukhopadhyay
Introduction to Hidden Markov Models for Gene Prediction ECE-S690
Introduction to Hidden Markov Models for Gene Prediction ECE-S690 Outline Markov Models The Hidden Part How can we use this for gene prediction? Learning Models Want to recognize patterns (e.g. sequence
An Analytical Model of Gene Evolution with 9 Mutation Parameters: An Application to the Amino Acids Coded by the Common Circular Code
Bulletin of Mathematical Biology (2007) 69: 677 698 DOI 10.1007/s11538-006-9147-z ORIGINAL ARTICLE An Analytical Model of Gene Evolution with 9 Mutation Parameters: An Application to the Amino Acids Coded
1 Hanoi Open Mathematical Competition 2017
1 Hanoi Open Mathematical Competition 017 1.1 Junior Section Question 1. Suppose x 1, x, x 3 are the roots of polynomial P (x) = x 3 6x + 5x + 1. The sum x 1 + x + x 3 is (A): 4 (B): 6 (C): 8 (D): 14 (E):
Motif Prediction in Amino Acid Interaction Networks
Motif Prediction in Amino Acid Interaction Networks Omar GACI and Stefan BALEV Abstract In this paper we represent a protein as a graph where the vertices are amino acids and the edges are interactions
Theorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.
5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field
Hidden Markov Models and some applications
Oleg Makhnin New Mexico Tech Dept. of Mathematics November 11, 2011 HMM description Application to genetic analysis Applications to weather and climate modeling Discussion HMM description Application to
An Introduction to Bioinformatics Algorithms Hidden Markov Models
Hidden Markov Models Outline 1. CG-Islands 2. The Fair Bet Casino 3. Hidden Markov Model 4. Decoding Algorithm 5. Forward-Backward Algorithm 6. Profile HMMs 7. HMM Parameter Estimation 8. Viterbi Training
POPULATION GENETICS Winter 2005 Lecture 17 Molecular phylogenetics
POPULATION GENETICS Winter 2005 Lecture 17 Molecular phylogenetics - in deriving a phylogeny our goal is simply to reconstruct the historical relationships between a group of taxa. - before we review the
Quantitative Understanding in Biology Module III: Linear Difference Equations Lecture I: Introduction to Linear Difference Equations
Quantitative Understanding in Biology Module III: Linear Difference Equations Lecture I: Introduction to Linear Difference Equations Introductory Remarks This section of the course introduces dynamic systems;
Small RNA in rice genome
Vol. 45 No. 5 SCIENCE IN CHINA (Series C) October 2002 Small RNA in rice genome WANG Kai ( 1, ZHU Xiaopeng ( 2, ZHONG Lan ( 1,3 & CHEN Runsheng ( 1,2 1. Beijing Genomics Institute/Center of Genomics and
The Causes and Consequences of Variation in. Evolutionary Processes Acting on DNA Sequences
The Causes and Consequences of Variation in Evolutionary Processes Acting on DNA Sequences This dissertation is submitted for the degree of Doctor of Philosophy at the University of Cambridge Lee Nathan