Inference rules for supernetwork construction Katharina Huber, School of Computing Sciences, University of East Anglia.

Slides:



Advertisements
Similar presentations
The multispecies coalescent: implications for inferring species trees
Advertisements

An Algorithm for Constructing Parsimonious Hybridization Networks with Multiple Phylogenetic Trees Yufeng Wu Dept. of Computer Science & Engineering University.
Context free languages 1. Equivalence of context free grammars 2. Normal forms.
A Separate Analysis Approach to the Reconstruction of Phylogenetic Networks Luay Nakhleh Department of Computer Sciences UT Austin.
1 Constructing Splits Graphs Author: Andreas W.M. Dress Daniel H. Huson Presented by: Bakhtiyar Uddin.
Minimum Spanning Tree CSE 331 Section 2 James Daly.
3.3 Spanning Trees Tucker, Applied Combinatorics, Section 3.3, by Patti Bodkin and Tamsen Hunter.
From Variable Elimination to Junction Trees
Chapter 3 The Greedy Method 3.
Formal Logic Proof Methods Direct Proof / Natural Deduction Conditional Proof (Implication Introduction) Reductio ad Absurdum Resolution Refutation.
1 Introduction to Computability Theory Lecture12: Decidable Languages Prof. Amos Israeli.
PDAs => CFGs Sipser 2.2 (pages ). Last time…
PDAs => CFGs Sipser 2.2 (pages ). Last time…
Tabu Search for Model Selection in Multiple Regression Zvi Drezner California State University Fullerton.
CS5371 Theory of Computation
Common Intervals in Sequences, Trees, and Graphs Steffen Heber and Jiangtian Li.
Unifying Local and Exhaustive Search John Hooker Carnegie Mellon University September 2005.
104 Closure Properties of Regular Languages Regular languages are closed under many set operations. Let L 1 and L 2 be regular languages. (1) L 1  L 2.
Trees and Red-Black Trees Gordon College Prof. Brinton.
On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations M.Sc. Thesis Defense Svetlana Olonetsky.
Inferring Evolutionary History with Network Models in Population Genomics: Challenges and Progress Yufeng Wu Dept. of Computer Science and Engineering.
Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees Yufeng Wu and Jiayin Wang Department of Computer Science and Engineering University.
Comparability Graphs and Permutation Graphs Martin Charles Golumbic.
3/29/05Tucker, Sec Applied Combinatorics, 4th Ed. Alan Tucker Section 4.2 Minimal Spanning Trees Prepared by Amanda Dargie and Michele Fretta.
Using PQ Trees For Comparative Genomics - CPM Using PQ Trees For Comparative Genomics Gad M. Landau – Univ. of Haifa Laxmi Parida – IBM T.J. Watson.
Copyright N. Friedman, M. Ninio. I. Pe’er, and T. Pupko. 2001RECOMB, April 2001 Structural EM for Phylogentic Inference Nir Friedman Computer Science &
Fall 2006Costas Busch - RPI1 PDAs Accept Context-Free Languages.
Learning and Planning for POMDPs Eyal Even-Dar, Tel-Aviv University Sham Kakade, University of Pennsylvania Yishay Mansour, Tel-Aviv University.
1 Tricks for trees: Having reconstructed phylogenies what can we do with them? DIMACS, June 2006 Mike Steel Allan Wilson Centre for Molecular Ecology and.
Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.
Systems of Linear Equations: Substitution and Elimination
Combinatorial and Statistical Approaches in Gene Rearrangement Analysis Jijun Tang Computer Science and Engineering University of South Carolina
Census A survey to collect data on the entire population.   Data The facts and figures collected, analyzed, and summarized for presentation and.
Information Security and Management 4. Finite Fields 8
Chapter 3 (Part 3): Mathematical Reasoning, Induction & Recursion  Recursive Algorithms (3.5)  Program Correctness (3.6)
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 4 (Part 3): Mathematical Reasoning, Induction.
CSCI 2670 Introduction to Theory of Computing September 21, 2004.
1 Dendroscope – An interactive viewer for large phylogenetic trees Daniel H. Huson Phylogenetics Programme, Newton Institute, September and networks.
PRESENTED BY SUNIL MANJERI Maximum sub-triangulation in pre- processing phylogenetic data Anne Berry * Alain Sigayret * Christine Sinoquet.
CS-2851 Dr. Mark L. Hornick 1 Okasaki’s Insertion Method for Red/Black balancing A step-by-step procedure for maintaining balance through application of.
Constructing evolutionary trees from rooted triples Bang Ye Wu Dept. of Computer Science and Information Engineering Shu-Te University.
Incomplete Directed Perfect Phylogeny Itsik Pe'er, Tal Pupko, Ron Shamir, and Roded Sharan SIAM Journal on Computing Volume 33, Number 3, pp
CP Summer School Modelling for Constraint Programming Barbara Smith 2. Implied Constraints, Optimization, Dominance Rules.
The bootstrap, consenus-trees, and super-trees Phylogenetics Workhop, August 2006 Barbara Holland.
Finding maximal planar subgraphs Wen-Lian Hsu 1/33.
Chapter 4 Probability ©. Sample Space sample space.S The possible outcomes of a random experiment are called the basic outcomes, and the set of all basic.
Learning bounded unions of Noetherian closed set systems via characteristic sets Yuichi Kameda 1, Hiroo Tokunaga 1 and Akihiro Yamamoto 2 1 Tokyo Metropolitan.
Relations and their Properties
Agenda Review: –Planar Graphs Lecture Content:  Concepts of Trees  Spanning Trees  Binary Trees Exercise.
Rensselaer Polytechnic Institute CSCI-4380 – Database Systems David Goldschmidt, Ph.D.
Closure Properties Lemma: Let A 1 and A 2 be two CF languages, then the union A 1  A 2 is context free as well. Proof: Assume that the two grammars are.
The Inference via DNA Computing Piort Wasiewicz et al. Proceedings of the 1999 Congress on Evolutionary Computation, vol. 2, pp Cho, Dong-Yeon.
Functional Dependencies CIS 4301 Lecture Notes Lecture 8 - 2/7/2006.
SupreFine, a new supertree method Shel Swenson September 17th 2009.
Why use phylogenetic networks?
Lecture 8CSE Intro to Cognitive Science1 Interpreting Line Drawings II.
Huffman code and Lossless Decomposition Prof. Sin-Min Lee Department of Computer Science.
§R1∪R2§R1∪R2 §R 1 ∩R 2 R1-R2R1-R2 2.4 Operations on Relations.
THE CONVENTIONS 2 simple rules: Rule # 1: Rule # 2: RR “move to the right until you find  “ Note: first check. Then move (think of a “while”) “Never.
Application of Phylogenetic Networks in Evolutionary Studies Daniel H. Huson and David Bryant Presented by Peggy Wang.
Costas Busch - LSU1 PDAs Accept Context-Free Languages.
Section Recursion 2  Recursion – defining an object (or function, algorithm, etc.) in terms of itself.  Recursion can be used to define sequences.
1 CS 201 Compiler Construction Code Optimizations: Partial Dead Code Elimination.
Conventions Red edges: traversed tree edges White edges: back edges
Exact Inference Continued
CS 581 Tandy Warnow.
Imputing Supertrees and Supernetworks from Quartets
Items and Itemsets An itemset is merely a set of items
Presentation transcript:

Inference rules for supernetwork construction Katharina Huber, School of Computing Sciences, University of East Anglia.

An ultimate goal gene2( ) gene1( )

But, … gene2( ) gene1( ) ?

Or, even worse gene2( ) gene1( ) ?

We could, … gene2( ) gene1( ) ?

or, … gene2( ) gene1( ) ?

Not very satisfactory!

So far,.. Z-closure supernetwork (Huson et al, 2004) Q-imputation (Holland et al, 2007), Attractive but produce many splits Filtering approaches

Weak compatibility (Bandelt and Dress, 1992) A1A1 A3A3 One of intersections marked by a dot is empty! A2A2 A2A2 A3A3 A1A1

Weak compatibility (Bandelt and Dress, 1992) A1A1 A3A3 A2A2 A2A2 A3A3 A1A1

Y- inference rule

M - inference rule (Meacham, 1972)

Repeat until inference process stabilizes Collection of partial splits apply inference rule and add (if underlying condition is violated stop) remove partial splits that can get extended A|B extends C|D if either A  C and B  D or A  D and B  C.

Theorem (Gruenewald, Huber, Wu) Suppose  is an irreducible collection of partial splits and  is either the Y- or M- or M/Y-rule. Then any two closures of   obtained via are the same. Irreducible: no split in  extends another split in . Closure: if the underlying condition(s) is (are) never violated, the set of partial splits generated when inference process stabilizes, and  otherwise.

Circular collections of partial splits S 1 =123|4567 S 2 =23|45671 S 3 =345|6712 S1S S2S2 S3S3 A collection  of partial split is said to be displayed by a cycle if every split in  can get extended to a full split such that the resulting split system is circular.

Theorem (Gruenewald, Huber, Wu) Suppose  is an irreducible collection of partial splits. Then  is displayed by a cycle C if and only if the closure of   via M/Y is displayed by C. In that case the closure of  via Y and the closure of  via M is also displayed by C.

Rivera et al’s ring of life Rivera et al, most probable phylogenetic trees from a study of 10 bacterial genomes from Rivera et al, 2004  in its early stages life was more like a network than a tree. How much does this result depend on the fact that trees were all on the same taxa set?

The ring of life Rivera et al, 2004 M/Y-inference rules Z-closure supernetwork