Frequent Inconsistency of Parsimony Under a Simple Model of Cladogenesis

Size: px
Start display at page:

Download "Frequent Inconsistency of Parsimony Under a Simple Model of Cladogenesis"

Transcription

1 Syst. Biol. 52(5): , 2003 Copyright c Society of Systematic Biologists ISSN: print / X online DOI: / Frequent Inconsistency of Parsimony Under a Simple Model of Cladogenesis JOHN P. HUELSENBECK 1 AND KATHERINE M. LANDER 2 1 Section of Ecology, Behavior and Evolution, Division of Biological Sciences, University of California San Diego, La Jolla, California , USA; johnh@biomail.ucsd.edu 2 Department of Biology, University of Rochester, Rochester, New York 14627, USA Abstract. Although the conditions under which the parsimony method becomes inconsistent have been studied for almost two decades, the probability that the parsimony method would encounter conditions causing inconsistency under simple models of cladogenesis is unknown. Here, we examine the statistical behavior of the parsimony method under a birth death model of cladogenesis, when the molecular clock holds. The parsimony method can become inconsistent a high proportion of the time even under this simple model of cladogenesis. When taxon sampling is poor or rates of evolution are high, the probability that parsimony will become inconsistent increases. [Birth death process; Felsenstein zone; inconsistency; parsimony.] We know what the conditions are for inconsistency of parsimony for some particular four- and five-species models, and these suggest that the problem may extend well beyond those cases. Is this reason for complacency on the part of users of parsimony methods? J. Felsenstein (1988:534) A phylogenetic method is inconsistent if it converges to an incorrect tree as more character data are included in the analysis. Usually, the term inconsistency is applied to the situation in which a method fails to converge to the correct parameter value when the assumptions of the analysis are satisfied. Many methods of phylogenetic inference, including maximum likelihood, are consistent in this sense. However, in the phylogenetics literature, the term has been applied more broadly to include cases in which the assumptions of the analysis are not satisfied. This broader use has been applied probably because it is difficult to identify the assumptions of some phylogenetic methods, such as the parsimony method. Statistical inconsistency under a wide range of conditions is one of the more distressing properties a phylogenetic method can possess. All current phylogenetic methods can become inconsistent when their assumptions are severely violated (Felsenstein, 1978; Hendy and Penny, 1989; DeBry, 1992; Huelsenbeck and Hillis, 1993; Yang, 1994; Huelsenbeck, 1995). However, some phylogenetic methods appear to be inconsistent under a wider range of conditions than are other methods. For example, it is known that the parsimony method can converge to an incorrect tree for the four-taxon case in which two of the branches are much longer (in terms of expected number of substitutions per site) than the remaining branches (Felsenstein, 1978). For the four-taxon case, parsimony is inconsistent only when the molecular clock is violated. However, with more than four taxa, Hendy and Penny (1989) identified cases in which parsimony will be inconsistent even under clock-like conditions. The five-taxon case found by Hendy and Penny (1989) was further explored by Zharkikh and Li (1993). Finally, Kim (1996) identified cases in which parsimony is inconsistent when all of the branches of the true tree are equal in length. Although the conditions (i.e., branch lengths, model of character change, and tree topology) under which parsimony becomes inconsistent are well characterized for some specific cases (Zharkikh and Li, 1993; Takezaki and Nei, 1994; Huelsenbeck, 1995), it is generally unknown how often these conditions might arise. All of the examples of inconsistency of parsimony (or any other method) consist of specific combinations of parameter values or ranges of parameter values that lead to the method converging on the wrong tree. We have no information on how often phylogenetic methods are inconsistent under even the simplest process of cladogenesis. Ideally, of course, one would like to know how often phylogenetic methods are inconsistent for real data. Unfortunately, this information is impossible to obtain, because the actual phylogenetic history is unknown in all but a few of the simplest cases (see Fitch and Atchley, 1985, 1987; Atchley and Fitch, 1991; Hillis et al., 1992). However, one can ask how often a phylogenetic method is inconsistent for trees that are generated under a process of cladogenesis. Although such a study cannot show how often a method might become inconsistent for real data, it can provide insights into how easily conditions might arise that would cause a phylogenetic method to become inconsistent. Among the simplest models of cladogenesis is the linear birth death process (Kendall, 1948). Under this process, speciation and extinction occur at constant rates. Obviously, the birth death process is unrealistic in several ways. For example, we know that speciation and extinction rates are not constant through time or across lineages. However, generating trees under the birth death process has several advantages. First, the process is stochastic; one can generate many different realizations of the process under the same parameter values and investigate the average performance of a phylogenetic method for the combination of parameter values explored. This means that the results of the consistency or inconsistency of a method do not depend upon any single tree or set of branch lengths, having been averaged over many trees generated under the cladogenetic model. Second, the birth death process can produce trees that vary systematically in a number of important features. Probably the most important feature is the bushiness of the trees produced under the process. For example, the 641

2 642 SYSTEMATIC BIOLOGY VOL. 52 fraction of the available species included in the analysis is known to influence the lengths of the terminal branches relative to the internal branches (Rannala et al., 1998). Small taxon-sampling fractions generally lead to trees with long terminal branches relative to the internal branches trees that are typically more difficult for phylogenetic methods to accurately reconstruct. The important point is this: despite its limitations as an accurate representation of the actual process of cladogenesis, the birth death process does allow the exploration of the fraction of the time a phylogenetic method will be inconsistent; this information cannot be gathered from observation of actual data sets or by the types of analyses of phylogenetic consistency that have been performed to date. In this article, we examine the statistical properties of the parsimony method for a simple model of cladogenesis with the object of characterizing the probability that the method will produce inconsistent estimates of phylogeny. We explored the performance of only the parsimony method for a couple of reasons. First, the method is fast. It would be very difficult to examine the consistency of the more computationally expensive methods, such as maximum likelihood or Bayesian inference. Second, several studies have suggested that parsimony is more liable to be inconsistent than methods that attempt, however poorly, to correct for multiple substitutions that occur along single branches of the tree (Huelsenbeck, 1995). It is likely, then, that an analysis of the behavior of the parsimony method under a simple model of cladogenesis will provide the bleakest possible picture of the frequency of the inconsistency problem. If parsimony is only rarely, if ever, inconsistent under a simple model of cladogenesis, then other methods such as maximum likelihood are unlikely to be inconsistent too. Indeed, the claim that the consistency issue is a red herring (Siddall and Kluge, 1997) would be well supported; why worry about the consistency of the parsimony method (or any other method, for that matter) if it is difficult to create conditions under simple models that lead to its inconsistency? If, on the other hand, parsimony is found to be frequently inconsistent under a simple model of cladogenesis, it might motivate a more systematic study of the behavior of parsimony and other phylogenetic methods under more realistic processes of cladogenesis. per site, and (3) a mechanism of change for the characters along the branches of the tree. In this study, we generated the branch lengths and topology of the tree simultaneously. The birth death process of cladogenesis with taxon sampling (Kendall, 1948; Nee et al., 1994), a very simple model of lineage splitting, determined the times between splitting events on the model tree. Under the birth death model, the probability of a speciation event along any branch in a small time interval, dt,is λ dt, and the probability of an extinction event is µdt. The probability of two or more events occurring in an instant of time is of order o(dt). We used a variant of the birth death process in which only a random fraction ρ of the species alive at the present are sampled (Yang and Rannala, 1997). The s sampled species (of a total of S species; ρ = s/s) are related through s 1 speciation events that occurred at times t = (t 1,...,t s 1 ). We condition on the first speciation event (t 1 ) occurring at t 1 = 1. The remaining speciation events (t 2,...,t s 1 ), then, occur at times on the interval (0, 1). Yang and Rannala (1997) derived the distribution of speciation times t 2,...,t s 1 under the birth death process with species sampling conditional on t 1 and s, the number of species in the sample. They presented a simple method for generating realizations under the birth death process of cladogenesis. First, one generates a randomly branching tree (τ), keeping track of the order of the speciation events on the tree. The nodes on the tree corresponding to the speciation events leading to the s sampled species are assigned speciation times as follows: Sample s 2 times from the probability distribution where h(y) = λp 1(y) v 1, (1) p 1 (t) = 1 ρ P(0,t)2 e (µ λ)t (2) is the probability that a lineage that arose at time t leaves exactly one descendant, METHODS The general strategy used in this study was to generate randomly bifurcating trees under a birth death process of cladogenesis, calculate the probability of all possible character patterns for each tree, and then estimate phylogeny under the parsimony criterion assuming that the possible character patterns occurred in their expected frequencies. Generation of Randomly Bifurcating Trees A phylogenetic model consists of three parts: (1) the topology of the tree, (2) the lengths of the branches of the tree in terms of expected number of substitutions and P(0,t) = v 1 = 1 1 ρ P(0, 1)2 e (µ λ), (3) ρ(λ µ) ρλ + (λ(1 ρ) µ)e (µ λ)t (4) is the probability that a lineage that arose at time t leaves at least one descendant. We used the transformation from a uniform random variable on the interval [0, 1] to a realization from h(y) derived by Yang and Rannala (1997). We ordered the resulting speciation times from largest to

3 2003 HUELSENBECK AND LANDER PARSIMONY CONSISTENCY 643 FIGURE 1. Realizations of the birth death process of cladogenesis for seven species when the speciation rate is twice the extinction rate and the sampling fraction (ρ) is 1.00 (a), 0.10 (b), and 0.01 (c).

4 644 SYSTEMATIC BIOLOGY VOL. 52 smallest and assigned these times to the nodes on the tree in their order of occurrence. The advantages of using this method for generating realizations under the birth death model of cladogenesis include its computational speed and ability to explore situations in which taxon sampling is poor. Figure 1 shows several realizations of trees of seven species under the birth death process when the speciation rate is twice the extinction rate (λ = 2µ) and the taxon sampling fraction (ρ) is 1 (Fig. 1a), 0.1 (Fig. 1b), and 0.01 (Fig. 1c). The trees of s species generated by the birth death process have tips at time 0.0 and root at time t 2 = 1.0. We converted these branch times into branch lengths that were in terms of expected number of substitutions per site by multiplying each branch by a factor m. The parameter m is referred to as the tree height and is interpreted as the number of substitutions expected to occur per site on a single lineage that reaches from the root of the tree to the tips. All of the trees generated in this study satisfy the molecular clock assumption. There are a number of different ways that trees can be produced under the birth death process. For example, the forward simulation approach, implemented in programs such as Bi-De (Rambaut et al., 1996), simulates speciation and extinction events explicitly. However, this strategy is computationally expensive. For one, if the extinction rate is large, many of the simulations will die off before the desired number of species is produced. For another, it is difficult to incorporate taxon sampling in the forward simulation approach. For example, to sample s = 10 species when the taxon sampling fraction is ρ = 10 6, one would need to simulate a total of S = 10 million species and randomly sample only s = 10 of them (ρ = s/s). Yang and Rannala (1997) presented a method that allows one to generate valid samples under the birth death process conditioned on any combination of λ, µ, and ρ. The only disadvantage of the Yang and Rannala (1997) method is that it is possible to pick very unrealistic combinations of parameter values and still generate trees; the trees may be very improbable if generated under the forward simulation scheme. For example, if λ = 10, µ = 1, and ρ = 1, on average s = species would result using the forward simulation method. Very few trees with only s = 10 tips would be generated under this combination of parameter values. Yet, the method of Yang and Rannala (1997) would allow simulations of any number of tips (s) under the same parameter values. In this study, we adjusted λ and µ (always with the constraint that λ = 2µ) such that the expected number of species that would be generated under the forward simulation approach with taxon sampling would equal the number of desired tip species, s. We simulated trees of s = 5, 6, 7, and 8 species and varied the tree height, m, from 0.05 to 1.0. For each combination of tree height and sampling fraction examined, we simulated a total of 10,000 realizations of the birth death process, except for the eight-species case, where we simulated 4,000 realizations. Other models of cladogenesis may produce trees with different branch lengths on average from those produced using the birth death model. The birth death model, however, provides a reasonable and simple starting point for examining the behavior of the parsimony method. Calculation of Character Pattern Frequencies After generating a randomly bifurcating tree (τ) ofs species under the birth death model of cladogenesis, we calculated the expected frequency of all 4 s possible DNA sequence site patterns for that tree. As an example, consider a tree of s = 3 species. There are 4 3 = 64 possible site patterns (Fig. 2), denoted x 1 ={A, A, A}, x 2 ={A, A, C}, x 3 ={A, A, G},..., x 63 ={T, T, G}, x 64 ={T, T, T}. We assume that the process generating the sites follows the Jukes Cantor model of DNA substitution (Jukes and Cantor, 1969). This model is a continuous-time Markov process in which the rates of change among different nucleotide states are equal. The transition probabilities from nucleotide i to nucleotide j for the Jukes Cantor model are 1 p ij (v) = e 4 3 v, i j , 4 e 4 3 v, i = j where v is the length of the branch in terms of expected number of substitutions per site. We assume that the rate of substitution across sites is equal. The probability of observing the ith site pattern (x i )is a sum over all possible assignments of nucleotide states to the interior nodes of the tree. Let the branch whose child is node k and whose parent is σ (k) have a length of v k expected substitutions per site. Also, let y be a data vector of nucleotide states at the interior nodes of the tree. The probability of observing the ith site pattern is then f (x i τ, t) = y ( )( ) 1 s 2s 2 p yσ 4 (k) x k (v k ) p yσ (k) y k (v k ). k=1 k=s+1 (5) This approach for exploring the consistency of a phylogenetic method was first applied by DeBry (1992) and Yang (1994). Species 1 AAAAAAAAAAAAAAAACCCCCCCCCCCCCCCCGGGGGGGGGGGGGGGGTTTTTTTTTTTTTTTT Species 2 AAAACCCCGGGGTTTTAAAACCCCGGGGTTTTAAAACCCCGGGGTTTTAAAACCCCGGGGTTTT Species 3 ACGTACGTACGTACGTACGTACGTACGTACGTACGTACGTACGTACGTACGTACGTACGTACGT FIGURE 2. The 64 site patterns possible for s = 3 species.

5 2003 HUELSENBECK AND LANDER PARSIMONY CONSISTENCY 645 Determining the Consistency of Parsimony We wrote a computer program to generate trees under the birth death process of cladogenesis, using the technique described above. We used the program PAUP (Swofford, 2002) to calculate the pattern probabilities and to find the most-parsimonious tree. For a particular realization of the birth death process (a tree with branch lengths), the consistency of the parsimony method was determined by using the expected site pattern frequencies of the 4 s site patterns as the observations. An exact search was then performed among all possible trees, and the parsimony score for each was recorded. Unfortunately, we could not calculate the tree lengths with infinite precision and did not want the consistency of the parsimony method to be influenced by limitations in accurately representing real numbers on a computer. Hence, we decided upon a conservative scheme for scoring the parsimony method as consistent or inconsistent for each realization of the birth death process. We calculated the expected lengths of all trees, assuming that the tree lengths were calculated on a data matrix of 5,000 characters (this was done by simply multiplying each tree length calculated using the pattern probabilities by 5,000). If the best parsimony tree was the same as the tree used to generate the site pattern probabilities (the true tree) or the best parsimony tree was within one step (out of 5,000 characters), then the method was considered consistent for that particular realization of the birth death process. If, on the other hand, the-maximum parsimony tree was more than one expected step (out of 5,000 characters) worse than the true tree, we considered the method to be inconsistent. Note that at two extremes all branches zero in length or all branches infinite in length the parsimony method would always be consistent under this criterion. We are mainly interested in the intermediate cases where the amount of evolution is moderate. RESULTS The birth death model of cladogenesis used in this study produced trees with a variety of branch lengths (Fig. 1). As noted previously (Rannala et al., 1998), the terminal branches were longer on average when the sampling fraction, ρ, was small. In other words, for small values of ρ the trees are more starlike, with terminal branches radiating nearer the base of the tree. One consequence of this result is that the expected number of changes per site over the entire tree also changes with the sampling fraction parameter, ρ. As ρ decreases (as more of the time can be found in the tips), the overall time on the tree increases and the average number of changes per site increases. Parsimony is often inconsistent even under the simple model of cladogenesis examined here. Figure 3 shows the probability that parsimony will provide consistent estimates of phylogeny for different values of the taxon sampling fraction, ρ, and for different numbers of FIGURE 3. The probability that parsimony is inconsistent under a birth death model of cladogenesis when the taxon sampling fraction (ρ) varies from 1.0 to 0.01.

6 646 SYSTEMATIC BIOLOGY VOL. 52 taxa. For low rates of evolution (m < 0.2), parsimony is inconsistent only rarely (<1% of the time). However, we found conditions of higher rates where parsimony was inconsistent as much as 13% of the time. The number of taxa included in the analysis also affects the probability that parsimony will provide inconsistent estimates of phylogeny. Figure 4 shows the probability of inconsistent estimates for 5, 6, 7, and 8 taxa. As the number of taxa increases, the probability that parsimony will become inconsistent also increases. This is true despite the fact that the average length of the branches of trees with more taxa is smaller than that for few taxa. DISCUSSION Why is parsimony inconsistent for the model of evolution chosen in this study? One of the difficulties of the parsimony method is that the assumptions are not explicitly stated. It is difficult, if not impossible, to evaluate FIGURE 4. from5to8. The probability that parsimony is inconsistent under a birth death model of cladogenesis when the number of species (s) is varied

7 2003 HUELSENBECK AND LANDER PARSIMONY CONSISTENCY 647 the performance of the method for cases in which all of its assumptions are satisfied. However, it is clear operationally how the parsimony procedure works: reconstruct changes on a tree and treat that tree with the minimum number of reconstructed changes as the best estimate of phylogeny. The manner in which characters are reconstructed on the tree (in this case, assuming that characters are unordered) underestimates the actual number of changes. In our study, this underestimate could be quite drastic. The underestimate of the number of changes becomes progressively worse as rates of evolution increase. The results presented here are based on a very simple model of cladogenesis and character evolution. It is fair, then, to ask whether these results generalize to other conditions. We suspect that the general result that parsimony is inconsistent a small fraction of the time will hold true if more complicated models of cladogenesis or character evolution are considered. However, future studies could be designed to examine the importance of additional factors. These factors could include (1) mass extinction, (2) more complicated models of substitution, (3) violation of the molecular clock, and (4) increased numbers of species. In particular, it might be useful to examine the effect that mass extinction has on the probability that parsimony is inconsistent. The simple birth death model of cladogenesis used here is unrealistic in the sense that it assumes that speciation and extinction rates are constant through time. It is also unknown how the results of this study will scale for larger numbers of species. Even the eight-species analyses took months of computer time, prohibiting an analysis of nine species where there are 135,135 possible trees and 4 9 = 262, 144 possible site patterns. Studies of more than 9 or 10 species will probably require the development of new methods for determining the consistency or inconsistency of a method. For example, one could explore the consistency of distance methods by concentrating on only the distance matrix that is expected to result from a particular tree. This focus would eliminate the problem of using all of the site patterns but for large phylogenetic problems would only allow the investigation of optimality criteria using a heuristic search or methods that rely on stepwise addition algorithms to build up trees. It is clear that the consistency of a method often is relevant, especially for difficult phylogenetic problems. In nature, difficult phylogenetic problems probably involve short internal branches and are the most likely to resist resolution. The most commonly applied, and of course reasonable, approach to difficult phylogenetic problems is to collect additional data with the hope that an analysis of the additional data, in combination with previously collected data, can resolve the phylogeny. There are numerous examples of difficult phylogenetic problems in the literature (e.g., Huelsenbeck, 1998), and the consistency of a method is relevant here, as one would hope that the problem would be solvable, in principal at least, if sufficient data were collected. Here, we have shown that a very simple model of cladogenesis and character evolution can produce phylogenetic problems for which parsimony will converge on an incorrect tree. This was true even though the simulation conditions were generous in the sense that the molecular clock holds and the process of character evolution was the simplest time-homogeneous model of DNA substitution available. ACKNOWLEDGMENTS J.P.H. was supported by NSF grants DEB and MCB and by a Wenner-Gren Foundation scholarship. REFERENCES ATCHLEY, W. R., AND W. M. FITCH Gene trees and the origins of inbred strains of mice. Science 254: DEBRY, R. W The consistency of several phylogeny-inference methods under varying evolutionary rates. Mol. Biol. Evol. 9: FELSENSTEIN, J Cases in which parsimony and compatibility methods will be positively misleading. Syst. Zool. 27: FELSENSTEIN, J Phylogenies from molecular sequences: Inference and reliability. Annu. Rev. Genet. 22: FITCH, W. M., AND W. R. ATCHLEY Evolution in inbred strains of mice appears rapid. Science 228: FITCH,W.M.,AND W. R. ATCHLEY Divergence in inbred strains of mice: A comparison of three different types of data. Pages in Molecules and morphology in evolution: Conflict or compromise? (C. Patterson, ed.). Cambridge Univ. Press, Cambridge, U.K. HENDY,M.D.,AND D. PENNY A framework for the quantitative study of evolutionary trees. Syst. Zool. 38: HILLIS, D.M.,J.J.BULL, M.E.WHITE, M.R.BADGETT, AND I. J. MOLINEUX Experimental phylogenetics: Generation of a known phylogeny. Science 255: HUELSENBECK, J. P Performance of phylogenetic methods in simulation. Syst. Biol. 44: HUELSENBECK, J. P Systematic bias in phylogenetics: Is the Strepsiptera problem solved? Syst. Biol. 47: HUELSENBECK, J. P., AND D. M. HILLIS Success of phylogenetic methods in the four-taxon case. Syst. Biol. 42: JUKES, T. H., AND C. R. CANTOR Evolution of protein molecules. Pages in Mammalian protein metabolism (H. N. Munro, ed.). Academic Press, New York. KENDALL, D. G On the generalized birth death process. Annu. Rev. Math. Stat. 19:1 15. KIM, J General inconsistency conditions for maximum parsimony: Effects of branch lengths and increasing number of species. Syst. Biol. 45: NEE, S., R. M. MAY, AND P. H. HARVEY The reconstructed evolutionary process. Philos. Trans. R. Soc. Lond. B 344: RAMBAUT, A., N. C. GRASSLY, S.NEE, AND P. H. HARVEY Bi- De: An application for simulating phylogenetic processes. Comput. Appl. Biosci. 12: RANNALA, B., J. P. HUELSENBECK, Z.YANG, AND R. NIELSEN Taxon sampling and the accuracy of large phylogenies. Syst. Biol. 47: SIDDALL, M. E., AND A. G. KLUGE Probabilism and phylogenetic inference. Cladistics 13: STEEL, M. A., M. D. HENDY, AND D. PENNY Parsimony can be consistent! Syst. Biol. 42: SWOFFORD, D. L PAUP*: Phylogenetic analysis using parsimony ( and other methods), version 4.0. Sinauer, Sunderland, Massachusetts.

8 648 SYSTEMATIC BIOLOGY VOL. 52 TAKEZAKI, N., AND M. NEI Inconsistency of the maximum parsimony method when the rate of nucleotide substitution is constant. J. Mol. Evol. 39: YANG, Z Statistical properties of the maximum likelihood method of phylogenetic estimation and comparison with distance matrix methods. Syst. Biol. 43: YANG, Z., AND B. RANNALA Bayesian phylogenetic inference using DNA sequences: A Markov chain Monte Carlo method. Mol. Biol. Evol. 14: ZHARKIKH, Z., AND W. H. LI Inconsistency of the maximumparsimony method: The case of five taxa with a molecular clock. Syst. Biol. 42: First submitted 18 November 2002; reviews returned 20 January 2003; final acceptance 2 May 2003 Associate Editor: Ziheng Yang

Coalescent Theory: An Introduction for Phylogenetics

Coalescent Theory: An Introduction for Phylogenetics Coalescent Theory: An Introduction for Phylogenetics Laura Salter Kubatko Departments of Statistics and Evolution, Ecology, and Organismal Biology The Ohio State University lkubatko@stat.ohio-state.edu

More information

Coalescence. Outline History. History, Model, and Application. Coalescence. The Model. Application

Coalescence. Outline History. History, Model, and Application. Coalescence. The Model. Application Coalescence History, Model, and Application Outline History Origins of theory/approach Trace the incorporation of other s ideas Coalescence Definition and descriptions The Model Assumptions and Uses Application

More information

Introduction to Biosystematics - Zool 575

Introduction to Biosystematics - Zool 575 Introduction to Biosystematics Lecture 21-1. Introduction to maximum likelihood - synopsis of how it works - likelihood of a single sequence - likelihood across a single branch - likelihood as branch length

More information

Algorithms for Genetics: Basics of Wright Fisher Model and Coalescent Theory

Algorithms for Genetics: Basics of Wright Fisher Model and Coalescent Theory Algorithms for Genetics: Basics of Wright Fisher Model and Coalescent Theory Vineet Bafna Harish Nagarajan and Nitin Udpa 1 Disclaimer Please note that a lot of the text and figures here are copied from

More information

Human origins and analysis of mitochondrial DNA sequences

Human origins and analysis of mitochondrial DNA sequences Human origins and analysis of mitochondrial DNA sequences Science, February 7, 1992 L. Vigilant et al. [1] recently presented "the strongest support yet for the placement of [their] common mtdna [mitochondrial

More information

Where do evolutionary trees comes from?

Where do evolutionary trees comes from? Probabilistic models of evolutionary trees Joint work with Outline of talk Part 1: History, overview Part 2: Discrete models of tree shape Part 3: Continuous trees Part 4: Applications: phylogenetic diversity,

More information

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! 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

More information

Comparative method, coalescents, and the future

Comparative method, coalescents, and the future Comparative method, coalescents, and the future Joe Felsenstein Depts. of Genome Sciences and of Biology, University of Washington Comparative method, coalescents, and the future p.1/36 Correlation of

More information

Comparative method, coalescents, and the future. Correlation of states in a discrete-state model

Comparative method, coalescents, and the future. Correlation of states in a discrete-state model Comparative method, coalescents, and the future Joe Felsenstein Depts. of Genome Sciences and of Biology, University of Washington Comparative method, coalescents, and the future p.1/28 Correlation of

More information

Population Structure and Genealogies

Population Structure and Genealogies Population Structure and Genealogies One of the key properties of Kingman s coalescent is that each pair of lineages is equally likely to coalesce whenever a coalescent event occurs. This condition is

More information

Phylogenetic Reconstruction Methods

Phylogenetic Reconstruction Methods Phylogenetic Reconstruction Methods Distance-based Methods Character-based Methods non-statistical a. parsimony statistical a. maximum likelihood b. Bayesian inference Parsimony has its roots in Hennig

More information

can mathematicians find the woods?

can mathematicians find the woods? Eolutionary trees, coalescents, and gene trees: can mathematicians find the woods? Joe Felsenstein Department of Genome Sciences and Department of Biology Eolutionary trees, coalescents, and gene trees:

More information

A Likelihood Method to Estimate/Detect Gene Flow and A Distance Method to. Estimate Species Trees in the Presence of Gene Flow.

A Likelihood Method to Estimate/Detect Gene Flow and A Distance Method to. Estimate Species Trees in the Presence of Gene Flow. A Likelihood Method to Estimate/Detect Gene Flow and A Distance Method to Estimate Species Trees in the Presence of Gene Flow Thesis Presented in Partial Fulfillment of the Requirements for the Degree

More information

Ioanna Manolopoulou and Brent C. Emerson. October 7, Abstract

Ioanna Manolopoulou and Brent C. Emerson. October 7, Abstract Phylogeographic Ancestral Inference Using the Coalescent Model on Haplotype Trees Ioanna Manolopoulou and Brent C. Emerson October 7, 2011 Abstract Phylogeographic ancestral inference is a question frequently

More information

Biology 559R: Introduction to Phylogenetic Comparative Methods Topics for this week (Feb 3 & 5):

Biology 559R: Introduction to Phylogenetic Comparative Methods Topics for this week (Feb 3 & 5): Biology 559R: Introduction to Phylogenetic Comparative Methods Topics for this week (Feb 3 & 5): Chronogram estimation: Penalized Likelihood Approach BEAST Presentations of your projects 1 The Anatomy

More information

Lecture 2. Tree space and searching tree space

Lecture 2. Tree space and searching tree space Lecture 2. Tree space and searching tree space Joe Felsenstein epartment of Genome Sciences and epartment of iology Lecture 2. Tree space and searching tree space p.1/48 Orang Gorilla himp Human Gibbon

More information

Statistical consistency and phylogenetic inference: a brief review. Andrew V. Z. Brower*

Statistical consistency and phylogenetic inference: a brief review. Andrew V. Z. Brower* Cladistics Cladistics (2017) 1 6 10.1111/cla.12216 Statistical consistency and phylogenetic inference: a brief review Andrew V. Z. Brower* Evolution and Ecology Group, Department of Biology, Middle Tennessee

More information

Recap: Properties of Trees. Rooting an unrooted tree. Questions trees can address: Data for phylogeny reconstruction. Rooted vs unrooted trees:

Recap: Properties of Trees. Rooting an unrooted tree. Questions trees can address: Data for phylogeny reconstruction. Rooted vs unrooted trees: Pairwise sequence alignment (global and local) Recap: Properties of rees Multiple sequence alignment global local ubstitution matrices atabase ing L equence statistics Leaf nodes contemporary taxa Internal

More information

Parsimony II Search Algorithms

Parsimony II Search Algorithms Parsimony II Search Algorithms Genome 373 Genomic Informatics Elhanan Borenstein Raw distance correction As two DNA sequences diverge, it is easy to see that their maximum raw distance is ~0.75 (assuming

More information

The Contest Between Parsimony and Likelihood. Elliott Sober*

The Contest Between Parsimony and Likelihood. Elliott Sober* The Contest Between Parsimony and Likelihood Elliott Sober* Two of the main methods that biologists now use to infer phylogenetic relationships are maximum likelihood and maximum parsimony. The method

More information

Evaluating the performance of likelihood methods for. detecting population structure and migration

Evaluating the performance of likelihood methods for. detecting population structure and migration Molecular Ecology (2004) 13, 837 851 doi: 10.1111/j.1365-294X.2004.02132.x Evaluating the performance of likelihood methods for Blackwell Publishing, Ltd. detecting population structure and migration ZAID

More information

Analysis of geographically structured populations: Estimators based on coalescence

Analysis of geographically structured populations: Estimators based on coalescence Analysis of geographically structured populations: Estimators based on coalescence Peter Beerli Department of Genetics, Box 357360, University of Washington, Seattle WA 9895-7360, Email: beerli@genetics.washington.edu

More information

Systematics - BIO 615

Systematics - BIO 615 Outline 1. Optimality riteria: Parsimony continued 2. istance vs character methods 3. uilding a tree vs finding a tree - lustering vs Optimality criterion methods 4. Performance of istance and clustering

More information

Genealogical trees, coalescent theory, and the analysis of genetic polymorphisms

Genealogical trees, coalescent theory, and the analysis of genetic polymorphisms Genealogical trees, coalescent theory, and the analysis of genetic polymorphisms Magnus Nordborg University of Southern California The importance of history Genetic polymorphism data represent the outcome

More information

Estimating effective population size and mutation rate from sequence data using Metropolis-Hastings sampling

Estimating effective population size and mutation rate from sequence data using Metropolis-Hastings sampling Estimating effective population size and mutation rate from sequence data using Metropolis-Hastings sampling Mary K. Kuhner, Jon Yamato, and Joseph Felsenstein Department of Genetics, University of Washington

More information

Phylogeny and Molecular Evolution

Phylogeny and Molecular Evolution Phylogeny and Molecular Evolution Character Based Phylogeny Large Parsimony 1/50 Credit Ron Shamir s lecture notes Notes by Nir Friedman Dan Geiger, Shlomo Moran, Sagi Snir and Ron Shamir Durbin et al.

More information

Project. B) Building the PWM Read the instructions of HO_14. 1) Determine all the 9-mers and list them here:

Project. B) Building the PWM Read the instructions of HO_14. 1) Determine all the 9-mers and list them here: Project Please choose ONE project among the given five projects. The last three projects are programming projects. hoose any programming language you want. Note that you can also write programs for the

More information

Lecture 30. Phylogeny methods, part 2 (Searching tree space) p.1/22

Lecture 30. Phylogeny methods, part 2 (Searching tree space) p.1/22 Lecture 30. Phylogeny methods, part 2 (Searching tree space) Joe elsenstein epartment of Genome Sciences and epartment of iology Lecture 30. Phylogeny methods, part 2 (Searching tree space) p.1/22 ll possible

More information

Coalescence time distributions for hypothesis testing -Kapil Rajaraman 498BIN, HW# 2

Coalescence time distributions for hypothesis testing -Kapil Rajaraman 498BIN, HW# 2 Coalescence time distributions for hypothesis testing -Kapil Rajaraman (rajaramn@uiuc.edu) 498BIN, HW# 2 This essay will be an overview of Maryellen Ruvolo s work on studying modern human origins using

More information

The African Origin Hypothesis What do the data tell us?

The African Origin Hypothesis What do the data tell us? The African Origin Hypothesis What do the data tell us? Mitochondrial DNA and Human Evolution Cann, Stoneking and Wilson, Nature 1987. WOS - 1079 citations Mitochondrial DNA and Human Evolution Cann, Stoneking

More information

arxiv: v1 [q-bio.pe] 4 Mar 2013

arxiv: v1 [q-bio.pe] 4 Mar 2013 Hybrid-Lambda: simulation of multiple merger and Kingman gene genealogies in species networks and species trees arxiv:1303.0673v1 [q-bio.pe] 4 Mar 2013 Sha Zhu 1,, James H Degnan 2 and Bjarki Eldon 3 1

More information

Generalized Game Trees

Generalized Game Trees Generalized Game Trees Richard E. Korf Computer Science Department University of California, Los Angeles Los Angeles, Ca. 90024 Abstract We consider two generalizations of the standard two-player game

More information

MOLECULAR POPULATION GENETICS: COALESCENT METHODS BASED ON SUMMARY STATISTICS

MOLECULAR POPULATION GENETICS: COALESCENT METHODS BASED ON SUMMARY STATISTICS MOLECULAR POPULATION GENETICS: COALESCENT METHODS BASED ON SUMMARY STATISTICS Daniel A. Vasco*, Keith A. Crandall* and Yun-Xin Fu *Department of Zoology, Brigham Young University, Provo, UT 8460, USA Human

More information

Do You Understand Evolutionary Trees? By T. Ryan Gregory

Do You Understand Evolutionary Trees? By T. Ryan Gregory Do You Understand Evolutionary Trees? By T. Ryan Gregory A single figure graces the pages of Charles Darwin's groundbreaking work On the Origin of Species, first published in 1859. The figure in question

More information

Chapter 12 Summary Sample Surveys

Chapter 12 Summary Sample Surveys Chapter 12 Summary Sample Surveys What have we learned? A representative sample can offer us important insights about populations. o It s the size of the same, not its fraction of the larger population,

More information

Chapter 4 SPEECH ENHANCEMENT

Chapter 4 SPEECH ENHANCEMENT 44 Chapter 4 SPEECH ENHANCEMENT 4.1 INTRODUCTION: Enhancement is defined as improvement in the value or Quality of something. Speech enhancement is defined as the improvement in intelligibility and/or

More information

Kinship and Population Subdivision

Kinship and Population Subdivision Kinship and Population Subdivision Henry Harpending University of Utah The coefficient of kinship between two diploid organisms describes their overall genetic similarity to each other relative to some

More information

TREES OF GENES IN POPULATIONS

TREES OF GENES IN POPULATIONS 1 TREES OF GENES IN POPULATIONS Joseph Felsenstein Abstract Trees of ancestry of copies of genes form in populations, as a result of the randomness of birth, death, and Mendelian reproduction. Considering

More information

Pedigree Reconstruction using Identity by Descent

Pedigree Reconstruction using Identity by Descent Pedigree Reconstruction using Identity by Descent Bonnie Kirkpatrick Electrical Engineering and Computer Sciences University of California at Berkeley Technical Report No. UCB/EECS-2010-43 http://www.eecs.berkeley.edu/pubs/techrpts/2010/eecs-2010-43.html

More information

Dice Games and Stochastic Dynamic Programming

Dice Games and Stochastic Dynamic Programming Dice Games and Stochastic Dynamic Programming Henk Tijms Dept. of Econometrics and Operations Research Vrije University, Amsterdam, The Netherlands Revised December 5, 2007 (to appear in the jubilee issue

More information

5 Inferring Population

5 Inferring Population 5 Inferring Population History and Demography While population genetics was a very theoretical discipline originally, the modern abundance of population genetic data has forced the field to become more

More information

What Do You Expect? Concepts

What Do You Expect? Concepts Important Concepts What Do You Expect? Concepts Examples Probability A number from 0 to 1 that describes the likelihood that an event will occur. Theoretical Probability A probability obtained by analyzing

More information

STRATEGY AND COMPLEXITY OF THE GAME OF SQUARES

STRATEGY AND COMPLEXITY OF THE GAME OF SQUARES STRATEGY AND COMPLEXITY OF THE GAME OF SQUARES FLORIAN BREUER and JOHN MICHAEL ROBSON Abstract We introduce a game called Squares where the single player is presented with a pattern of black and white

More information

The genealogical history of a population The coalescent process. Identity by descent Distribution of pairwise coalescence times

The genealogical history of a population The coalescent process. Identity by descent Distribution of pairwise coalescence times The coalescent The genealogical history of a population The coalescent process Identity by descent Distribution of pairwise coalescence times Adding mutations Expected pairwise differences Evolutionary

More information

Forward thinking: the predictive approach

Forward thinking: the predictive approach Coalescent Theory 1 Forward thinking: the predictive approach Random variation in reproduction causes random fluctuation in allele frequencies. Can describe this process as diffusion: (Wright 1931) showed

More information

6.047/6.878 Lecture 21: Phylogenomics II

6.047/6.878 Lecture 21: Phylogenomics II Guest Lecture by Matt Rasmussen Orit Giguzinsky and Ethan Sherbondy December 13, 2012 1 Contents 1 Introduction 3 2 Inferring Orthologs/Paralogs, Gene Duplication and Loss 3 2.1 Species Tree..............................................

More information

On uniquely k-determined permutations

On uniquely k-determined permutations On uniquely k-determined permutations Sergey Avgustinovich and Sergey Kitaev 16th March 2007 Abstract Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce

More information

Ancestral Recombination Graphs

Ancestral Recombination Graphs Ancestral Recombination Graphs Ancestral relationships among a sample of recombining sequences usually cannot be accurately described by just a single genealogy. Linked sites will have similar, but not

More information

Data Acquisition & Computer Control

Data Acquisition & Computer Control Chapter 4 Data Acquisition & Computer Control Now that we have some tools to look at random data we need to understand the fundamental methods employed to acquire data and control experiments. The personal

More information

Exploring the Demographic History of DNA Sequences Using the Generalized Skyline Plot

Exploring the Demographic History of DNA Sequences Using the Generalized Skyline Plot Exploring the Demographic History of DNA Sequences Using the Generalized Syline Plot Korbinian Strimmer and Oliver G. Pybus Department of Zoology, University of Oxford We present an intuitive visual framewor,

More information

Kenneth Nordtvedt. Many genetic genealogists eventually employ a time-tomost-recent-common-ancestor

Kenneth Nordtvedt. Many genetic genealogists eventually employ a time-tomost-recent-common-ancestor Kenneth Nordtvedt Many genetic genealogists eventually employ a time-tomost-recent-common-ancestor (TMRCA) tool to estimate how far back in time the common ancestor existed for two Y-STR haplotypes obtained

More information

Evolutions of communication

Evolutions of communication Evolutions of communication Alex Bell, Andrew Pace, and Raul Santos May 12, 2009 Abstract In this paper a experiment is presented in which two simulated robots evolved a form of communication to allow

More information

2. Survey Methodology

2. Survey Methodology Analysis of Butterfly Survey Data and Methodology from San Bruno Mountain Habitat Conservation Plan (1982 2000). 2. Survey Methodology Travis Longcore University of Southern California GIS Research Laboratory

More information

Module 3 Greedy Strategy

Module 3 Greedy Strategy Module 3 Greedy Strategy Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu Introduction to Greedy Technique Main

More information

Game Theory and Randomized Algorithms

Game Theory and Randomized Algorithms Game Theory and Randomized Algorithms Guy Aridor Game theory is a set of tools that allow us to understand how decisionmakers interact with each other. It has practical applications in economics, international

More information

Lab/Project Error Control Coding using LDPC Codes and HARQ

Lab/Project Error Control Coding using LDPC Codes and HARQ Linköping University Campus Norrköping Department of Science and Technology Erik Bergfeldt TNE066 Telecommunications Lab/Project Error Control Coding using LDPC Codes and HARQ Error control coding is an

More information

Coalescents. Joe Felsenstein. GENOME 453, Autumn Coalescents p.1/48

Coalescents. Joe Felsenstein. GENOME 453, Autumn Coalescents p.1/48 Coalescents p.1/48 Coalescents Joe Felsenstein GENOME 453, Autumn 2015 Coalescents p.2/48 Cann, Stoneking, and Wilson Becky Cann Mark Stoneking the late Allan Wilson Cann, R. L., M. Stoneking, and A. C.

More information

Bootstraps and testing trees

Bootstraps and testing trees ootstraps and testing trees Joe elsenstein epts. of Genome Sciences and of iology, University of Washington ootstraps and testing trees p.1/20 ln L log-likelihood curve and its confidence interval 2620

More information

(Refer Slide Time: 3:11)

(Refer Slide Time: 3:11) Digital Communication. Professor Surendra Prasad. Department of Electrical Engineering. Indian Institute of Technology, Delhi. Lecture-2. Digital Representation of Analog Signals: Delta Modulation. Professor:

More information

5.4 Imperfect, Real-Time Decisions

5.4 Imperfect, Real-Time Decisions 116 5.4 Imperfect, Real-Time Decisions Searching through the whole (pruned) game tree is too inefficient for any realistic game Moves must be made in a reasonable amount of time One has to cut off the

More information

The Pennsylvania State University. The Graduate School. College of Engineering STATE SPACE MODELING, ANALYSIS, AND SIMULATION

The Pennsylvania State University. The Graduate School. College of Engineering STATE SPACE MODELING, ANALYSIS, AND SIMULATION The Pennsylvania State University The Graduate School College of Engineering STATE SPACE MODELING, ANALYSIS, AND SIMULATION OF IDEAL SWITCHED RLCM NETWORKS A Thesis in Electrical Engineering by Saleh Mahdi

More information

Experiments on Alternatives to Minimax

Experiments on Alternatives to Minimax Experiments on Alternatives to Minimax Dana Nau University of Maryland Paul Purdom Indiana University April 23, 1993 Chun-Hung Tzeng Ball State University Abstract In the field of Artificial Intelligence,

More information

Module 3 Greedy Strategy

Module 3 Greedy Strategy Module 3 Greedy Strategy Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu Introduction to Greedy Technique Main

More information

Population Genetics using Trees. Peter Beerli Genome Sciences University of Washington Seattle WA

Population Genetics using Trees. Peter Beerli Genome Sciences University of Washington Seattle WA Population Genetics using Trees Peter Beerli Genome Sciences University of Washington Seattle WA Outline 1. Introduction to the basic coalescent Population models The coalescent Likelihood estimation of

More information

5.4 Imperfect, Real-Time Decisions

5.4 Imperfect, Real-Time Decisions 5.4 Imperfect, Real-Time Decisions Searching through the whole (pruned) game tree is too inefficient for any realistic game Moves must be made in a reasonable amount of time One has to cut off the generation

More information

Chapter 12 Gene Genealogies

Chapter 12 Gene Genealogies Chapter 12 Gene Genealogies Noah A. Rosenberg Program in Molecular and Computational Biology. University of Southern California, Los Angeles, California 90089-1113 USA. E-mail: noahr@usc.edu. Phone: 213-740-2416.

More information

2 The Wright-Fisher model and the neutral theory

2 The Wright-Fisher model and the neutral theory 0 THE WRIGHT-FISHER MODEL AND THE NEUTRAL THEORY The Wright-Fisher model and the neutral theory Although the main interest of population genetics is conceivably in natural selection, we will first assume

More information

More on games (Ch )

More on games (Ch ) More on games (Ch. 5.4-5.6) Announcements Midterm next Tuesday: covers weeks 1-4 (Chapters 1-4) Take the full class period Open book/notes (can use ebook) ^^ No programing/code, internet searches or friends

More information

MAT3707. Tutorial letter 202/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/202/1/2017

MAT3707. Tutorial letter 202/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/202/1/2017 MAT3707/0//07 Tutorial letter 0//07 DISCRETE MATHEMATICS: COMBINATORICS MAT3707 Semester Department of Mathematical Sciences SOLUTIONS TO ASSIGNMENT 0 BARCODE Define tomorrow university of south africa

More information

The Two Phases of the Coalescent and Fixation Processes

The Two Phases of the Coalescent and Fixation Processes The Two Phases of the Coalescent and Fixation Processes Introduction The coalescent process which traces back the current population to a common ancestor and the fixation process which follows an individual

More information

GENOMIC REARRANGEMENT ALGORITHMS

GENOMIC REARRANGEMENT ALGORITHMS GENOMIC REARRANGEMENT ALGORITHMS KAREN LOSTRITTO Abstract. In this paper, I discuss genomic rearrangement. Specifically, I describe the formal representation of these genomic rearrangements as well as

More information

Coalescents. Joe Felsenstein. GENOME 453, Winter Coalescents p.1/39

Coalescents. Joe Felsenstein. GENOME 453, Winter Coalescents p.1/39 Coalescents Joe Felsenstein GENOME 453, Winter 2007 Coalescents p.1/39 Cann, Stoneking, and Wilson Becky Cann Mark Stoneking the late Allan Wilson Cann, R. L., M. Stoneking, and A. C. Wilson. 1987. Mitochondrial

More information

A Comparative Study of Quality of Service Routing Schemes That Tolerate Imprecise State Information

A Comparative Study of Quality of Service Routing Schemes That Tolerate Imprecise State Information A Comparative Study of Quality of Service Routing Schemes That Tolerate Imprecise State Information Xin Yuan Wei Zheng Department of Computer Science, Florida State University, Tallahassee, FL 330 {xyuan,zheng}@cs.fsu.edu

More information

Optimization of Tile Sets for DNA Self- Assembly

Optimization of Tile Sets for DNA Self- Assembly Optimization of Tile Sets for DNA Self- Assembly Joel Gawarecki Department of Computer Science Simpson College Indianola, IA 50125 joel.gawarecki@my.simpson.edu Adam Smith Department of Computer Science

More information

Journal of Discrete Mathematical Sciences & Cryptography Vol. ( ), No., pp. 1 10

Journal of Discrete Mathematical Sciences & Cryptography Vol. ( ), No., pp. 1 10 Dynamic extended DES Yi-Shiung Yeh 1, I-Te Chen 2, Ting-Yu Huang 1, Chan-Chi Wang 1, 1 Department of Computer Science and Information Engineering National Chiao-Tung University 1001 Ta-Hsueh Road, HsinChu

More information

The Behavior Evolving Model and Application of Virtual Robots

The Behavior Evolving Model and Application of Virtual Robots The Behavior Evolving Model and Application of Virtual Robots Suchul Hwang Kyungdal Cho V. Scott Gordon Inha Tech. College Inha Tech College CSUS, Sacramento 253 Yonghyundong Namku 253 Yonghyundong Namku

More information

Full Length Research Article

Full Length Research Article Full Length Research Article ON THE EXTINCTION PROBABILITY OF A FAMILY NAME *DZAAN, S. K 1., ONAH, E. S 2. & KIMBIR, A. R 2. 1 Department of Mathematics and Computer Science University of Mkar, Gboko Nigeria.

More information

INSA CASSENS,PATRICK MARDULYN, AND MICHEL C. MILINKOVITCH

INSA CASSENS,PATRICK MARDULYN, AND MICHEL C. MILINKOVITCH Syst. Biol. 54(3):363 372, 2005 Copyright c Society of Systematic Biologists ISSN: 1063-5157 print / 1076-836X online DOI: 10.1080/10635150590945377 Evaluating Intraspecific Network Construction Methods

More information

Inbreeding and self-fertilization

Inbreeding and self-fertilization Inbreeding and self-fertilization Introduction Remember that long list of assumptions associated with derivation of the Hardy-Weinberg principle that we just finished? Well, we re about to begin violating

More information

Measurement Techniques

Measurement Techniques Measurement Techniques Anders Sjöström Juan Negreira Montero Department of Construction Sciences. Division of Engineering Acoustics. Lund University Disposition Introduction Errors in Measurements Signals

More information

Chapter 2 Distributed Consensus Estimation of Wireless Sensor Networks

Chapter 2 Distributed Consensus Estimation of Wireless Sensor Networks Chapter 2 Distributed Consensus Estimation of Wireless Sensor Networks Recently, consensus based distributed estimation has attracted considerable attention from various fields to estimate deterministic

More information

From ProbLog to ProLogic

From ProbLog to ProLogic From ProbLog to ProLogic Angelika Kimmig, Bernd Gutmann, Luc De Raedt Fluffy, 21/03/2007 Part I: ProbLog Motivating Application ProbLog Inference Experiments A Probabilistic Graph Problem What is the probability

More information

Multi-user Space Time Scheduling for Wireless Systems with Multiple Antenna

Multi-user Space Time Scheduling for Wireless Systems with Multiple Antenna Multi-user Space Time Scheduling for Wireless Systems with Multiple Antenna Vincent Lau Associate Prof., University of Hong Kong Senior Manager, ASTRI Agenda Bacground Lin Level vs System Level Performance

More information

Viral epidemiology and the Coalescent

Viral epidemiology and the Coalescent Viral epidemiology and the Coalescent Philippe Lemey and Marc A. Suchard Department of Microbiology and Immunology K.U. Leuven, and Departments of Biomathematics and Human Genetics David Geffen School

More information

Regulatory Motif Finding II

Regulatory Motif Finding II Regulatory Motif Finding II Lectures 13 Nov 9, 2011 CSE 527 Computational Biology, Fall 2011 Instructor: Su-In Lee TA: Christopher Miles Monday & Wednesday 12:00-1:20 Johnson Hall (JHN) 022 1 Outline Regulatory

More information

Trip Assignment. Lecture Notes in Transportation Systems Engineering. Prof. Tom V. Mathew. 1 Overview 1. 2 Link cost function 2

Trip Assignment. Lecture Notes in Transportation Systems Engineering. Prof. Tom V. Mathew. 1 Overview 1. 2 Link cost function 2 Trip Assignment Lecture Notes in Transportation Systems Engineering Prof. Tom V. Mathew Contents 1 Overview 1 2 Link cost function 2 3 All-or-nothing assignment 3 4 User equilibrium assignment (UE) 3 5

More information

Improved Draws for Highland Dance

Improved Draws for Highland Dance Improved Draws for Highland Dance Tim B. Swartz Abstract In the sport of Highland Dance, Championships are often contested where the order of dance is randomized in each of the four dances. As it is a

More information

The study of probability is concerned with the likelihood of events occurring. Many situations can be analyzed using a simplified model of probability

The study of probability is concerned with the likelihood of events occurring. Many situations can be analyzed using a simplified model of probability The study of probability is concerned with the likelihood of events occurring Like combinatorics, the origins of probability theory can be traced back to the study of gambling games Still a popular branch

More information

Phylogenetic analysis of Gregory of Nazianzus Homily 27

Phylogenetic analysis of Gregory of Nazianzus Homily 27 Phylogenetic analysis of Gregory of Nazianzus Homily 27 Anne-Catherine Lantin 1, Philippe V. Baret 1, Caroline Macé 2 1 Université catholique de Louvain AGRO GENA 1348 Louvain-la-Neuve Belgique 2 Katholieke

More information

Advanced data analysis in population genetics Likelihood-based demographic inference using the coalescent

Advanced data analysis in population genetics Likelihood-based demographic inference using the coalescent Advanced data analysis in population genetics Likelihood-based demographic inference using the coalescent Raphael Leblois Centre de Biologie pour la Gestion des Populations (CBGP), INRA, Montpellier master

More information

large group of moving shorebirds (or other organism).

large group of moving shorebirds (or other organism). Bird Beans Grade Level: upper elementary/ middle school Duration: 30-40 minutes Skills: critical thinking, comparison, collection and interpretation of data, vocabulary, discussion, and visualization Subjects:

More information

More on games (Ch )

More on games (Ch ) More on games (Ch. 5.4-5.6) Alpha-beta pruning Previously on CSci 4511... We talked about how to modify the minimax algorithm to prune only bad searches (i.e. alpha-beta pruning) This rule of checking

More information

OFDM Transmission Corrupted by Impulsive Noise

OFDM Transmission Corrupted by Impulsive Noise OFDM Transmission Corrupted by Impulsive Noise Jiirgen Haring, Han Vinck University of Essen Institute for Experimental Mathematics Ellernstr. 29 45326 Essen, Germany,. e-mail: haering@exp-math.uni-essen.de

More information

Achieving Desirable Gameplay Objectives by Niched Evolution of Game Parameters

Achieving Desirable Gameplay Objectives by Niched Evolution of Game Parameters Achieving Desirable Gameplay Objectives by Niched Evolution of Game Parameters Scott Watson, Andrew Vardy, Wolfgang Banzhaf Department of Computer Science Memorial University of Newfoundland St John s.

More information

Session 5 Variation About the Mean

Session 5 Variation About the Mean Session 5 Variation About the Mean Key Terms for This Session Previously Introduced line plot median variation New in This Session allocation deviation from the mean fair allocation (equal-shares allocation)

More information

World Journal of Engineering Research and Technology WJERT

World Journal of Engineering Research and Technology WJERT wjert, 017, Vol. 3, Issue 4, 406-413 Original Article ISSN 454-695X WJERT www.wjert.org SJIF Impact Factor: 4.36 DENOISING OF 1-D SIGNAL USING DISCRETE WAVELET TRANSFORMS Dr. Anil Kumar* Associate Professor,

More information

Evolutionary trees and population genetics: a family reunion

Evolutionary trees and population genetics: a family reunion Evolutionary trees and population genetics: a family reunion 9 October 2009. Joe Felsenstein 500th anniversary (or something) of the University of Chicago Evolutionary trees and population genetics: a

More information

How to Make the Perfect Fireworks Display: Two Strategies for Hanabi

How to Make the Perfect Fireworks Display: Two Strategies for Hanabi Mathematical Assoc. of America Mathematics Magazine 88:1 May 16, 2015 2:24 p.m. Hanabi.tex page 1 VOL. 88, O. 1, FEBRUARY 2015 1 How to Make the erfect Fireworks Display: Two Strategies for Hanabi Author

More information

Warning: software often displays unrooted trees like this:

Warning: software often displays unrooted trees like this: Warning: software often displays unrooted trees like this: /------------------------------ Chara /-------------------------- Chlorella /---------16 \---------------------------- Volvox +-------------------17

More information

The topic for the third and final major portion of the course is Probability. We will aim to make sense of statements such as the following:

The topic for the third and final major portion of the course is Probability. We will aim to make sense of statements such as the following: CS 70 Discrete Mathematics for CS Spring 2006 Vazirani Lecture 17 Introduction to Probability The topic for the third and final major portion of the course is Probability. We will aim to make sense of

More information