VAST 2011 Sebastian Bremm, Tatiana von Landesberger, Martin Heß, Tobias Schreck, Philipp Weil, and Kay Hamacher Interactive-Graphics Systems TU Darmstadt,

Slides:



Advertisements
Similar presentations
1 CSE 980: Data Mining Lecture 16: Hierarchical Clustering.
Advertisements

Hierarchical Clustering. Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree-like diagram that.
Data Mining Cluster Analysis: Basic Concepts and Algorithms
TREES Chapter 6. Trees - Introduction  All previous data organizations we've studied are linear—each element can have only one predecessor and successor.
Edited by Malak Abdullah Jordan University of Science and Technology Data Structures Using C++ 2E Chapter 12 Graphs.
Data Mining Techniques: Clustering
Image Indexing and Retrieval using Moment Invariants Imran Ahmad School of Computer Science University of Windsor – Canada.
CS 171: Introduction to Computer Science II
CS2420: Lecture 13 Vladimir Kulyukin Computer Science Department Utah State University.
1 Trees. 2 Outline –Tree Structures –Tree Node Level and Path Length –Binary Tree Definition –Binary Tree Nodes –Binary Search Trees.
Lists A list is a finite, ordered sequence of data items. Two Implementations –Arrays –Linked Lists.
Visual Querying By Color Perceptive Regions Alberto del Bimbo, M. Mugnaini, P. Pala, and F. Turco University of Florence, Italy Pattern Recognition, 1998.
CSE 222 Systems Programming Graph Theory Basics Dr. Jim Holten.
Phylogenetic Tree Construction and Related Problems Bioinformatics.
CSC 2300 Data Structures & Algorithms February 6, 2007 Chapter 4. Trees.
Important Problem Types and Fundamental Data Structures
Discrete Mathematics Lecture 9 Alexander Bukharovich New York University.
C o n f i d e n t i a l HOME NEXT Subject Name: Data Structure Using C Unit Title: Trees.
Systematic Analysis of Interactome: A New Trend in Bioinformatics KOCSEA Technical Symposium 2010 Young-Rae Cho, Ph.D. Assistant Professor Department of.
Binary Trees Chapter 6.
Bioinformatics Programming 1 EE, NCKU Tien-Hao Chang (Darby Chang)
Advanced Algorithms Analysis and Design Lecture 8 (Continue Lecture 7…..) Elementry Data Structures By Engr Huma Ayub Vine.
Chapter 19: Binary Trees. Objectives In this chapter, you will: – Learn about binary trees – Explore various binary tree traversal algorithms – Organize.
Trees. Introduction to Trees Trees are very common in computer science They come in different forms They are used as data representation in many applications.
1 Generalized Tree Alignment: The Deferred Path Heuristic Stinus Lindgreen
Introduction Of Tree. Introduction A tree is a non-linear data structure in which items are arranged in sequence. It is used to represent hierarchical.
Created on 29/10/2008yahaya.wordpress.com1 Trees Another common nonlinear data structure is the tree. We have already seen an example of a tree when we.
Presenter: Yang Ruan Indiana University Bloomington
Binary Trees. Binary Tree Finite (possibly empty) collection of elements A nonempty binary tree has a root element The remaining elements (if any) are.
Binary Trees, Binary Search Trees RIZWAN REHMAN CENTRE FOR COMPUTER STUDIES DIBRUGARH UNIVERSITY.
A Study of Balanced Search Trees: Brainstorming a New Balanced Search Tree Anthony Kim, 2005 Computer Systems Research.
MA/CSSE 473 Day 28 Dynamic Programming Binomial Coefficients Warshall's algorithm Student questions?
TREES. What is a tree ? An Abstract Data Type which emulates a tree structure with a set of linked nodes The nodes within a tree are organized in a hierarchical.
Semantic Wordfication of Document Collections Presenter: Yingyu Wu.
Data Structures TREES.
Discrete Structures Trees (Ch. 11)
Algorithmic Detection of Semantic Similarity WWW 2005.
BIRCH: An Efficient Data Clustering Method for Very Large Databases Tian Zhang, Raghu Ramakrishnan, Miron Livny University of Wisconsin-Maciison Presented.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI CSCI 240 Recursion and Trees Dale Roberts, Lecturer
Tree Traversals, TreeSort 20 February Expression Tree Leaves are operands Interior nodes are operators A binary tree to represent (A - B) + C.
Discrete Mathematics Chapter 5 Trees.
Hierarchical Clustering Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree like diagram that.
M180: Data Structures & Algorithms in Java Trees & Binary Trees Arab Open University 1.
DATA STRUCTURE BS(IT)3rd. Tree An Introduction By Yasir Mustafa Roll No. BS(IT) Bahauddin Zakariya University, Multan.
CHAPTER 11 TREES INTRODUCTION TO TREES ► A tree is a connected undirected graph with no simple circuit. ► An undirected graph is a tree if and only.
1 An Efficient Optimal Leaf Ordering for Hierarchical Clustering in Microarray Gene Expression Data Analysis Jianting Zhang Le Gruenwald School of Computer.
Chapter 20: Graphs. Objectives In this chapter, you will: – Learn about graphs – Become familiar with the basic terminology of graph theory – Discover.
Hierarchical clustering approaches for high-throughput data Colin Dewey BMI/CS 576 Fall 2015.
Chapter 11. Chapter Summary  Introduction to trees (11.1)  Application of trees (11.2)  Tree traversal (11.3)  Spanning trees (11.4)
Discrete Structures Li Tak Sing( 李德成 ) Lectures
Tree Representation and Terminology Binary Trees Binary Search Trees Pointer-Based Representation of a Binary Tree Array-Based Representation of a Binary.
Data Structure and Algorithms
Lecture 1 (UNIT -4) TREE SUNIL KUMAR CIT-UPES.
Balanced Binary Search Trees
MCS680: Foundations Of Computer Science
Section 8.1 Trees.
Multiple Alignment and Phylogenetic Trees
CS223 Advanced Data Structures and Algorithms
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 10 Trees Slides are adopted from “Discrete.
Hierarchical clustering approaches for high-throughput data
Scale-Space Representation of 3D Models and Topological Matching
Comparative RNA Structural Analysis
The BIRCH Algorithm Davitkov Miroslav, 2011/3116
Binary Trees, Binary Search Trees
Trees 11.1 Introduction to Trees Dr. Halimah Alshehri.
Important Problem Types and Fundamental Data Structures
Hierarchical Clustering
“Traditional” image segmentation
Binary Trees, Binary Search Trees
Data Structures Using C++ 2E
Presentation transcript:

VAST 2011 Sebastian Bremm, Tatiana von Landesberger, Martin Heß, Tobias Schreck, Philipp Weil, and Kay Hamacher Interactive-Graphics Systems TU Darmstadt, Germany

 Introduction  Related Work  Approach to Visual Comparison of Sets of Trees  Application to Ribosomal Phylogenies  Conclusion

 The goal of comparing phylogenetic trees is to find similarities and differences between them at the same time.  This is not restricted to global similarity evaluation, but more importantly, also encompasses the assessment of local patterns.  to distinguish two different levels of complexity ◦ the number of trees to compare ◦ the number of leafs in each tree

 Biologists currently have no readily available advanced methods for the visual comparison of phylogenetic trees. ◦ to support visualization of single trees as node link diagrams, e.g., using the FigTree software ◦ for multiple trees, a typical approach is a simple visualization of pairwise tree similarities by a heatmap.  it does not provide structural tree comparison and assessment of local patterns

 The main contributions and application benefits are: ◦ a new visual analytics approach to compare multiple trees, both on global and local levels ◦ a new distance measure to compare rooted trees ◦ it has various application benefits for comparing sets of phylogenetic trees

 The main approaches for visual tree analysis include node-link diagrams and treemaps.  Node-link diagrams are well suited for the visualization of phylogenetic trees. ◦ allow for the representation of weighted edges ◦ offer an very intuitive representation of binary trees ◦ The usage of links between nodes for larger graphs may be space inefficient.

 Alternative space efficient techniques, such as treemaps. ◦ use the whole available space ◦ they recursively lay out child nodes within their respective parent nodes ◦ employ overlapping of the parent nodes ◦ the users may encounter difficulties with the assessment of the tree structure

 Existing techniques for visual comparison of trees focus on pairwise structural comparison and on comparison of multiple trees.  current pairwise visual tree comparison approaches: ◦ focusing on leaf node matching ◦ focusing on matching most similar structures  the red nodes are the best matches based on a comparison score, yet different subtree structures exist ◦ tree comparison using union trees and contrast treemaps

(a)(b)(c)

 Shown are pairwise distances between phylogenetic trees and their hierarchical clustering as computed by the TOPD/FMTS package. ◦ use simple visualization of pairwise tree similarities in a heatmap combined with hierarchic clustering ◦ does not offer structural tree comparison and assessment of local pattern differences

 Our approach supports the comparison of multiple, rooted trees with identical leaf elements.  It is designed to support identification of similarities and differences between these trees. ◦ an initial overview shows the similarity matrix between all trees ◦ one reference tree can be selected for a detailed comparison with other trees ◦ all views are supported by integrated calculation of local and global similarity measures

 Definitions ◦ a tree T consists of set of undirected edges E that connect pairs of nodes V, formally defined as ◦ if one node r is distinguished as a so-called root node: T = (V;E; r) ◦ a path in a tree is defined as a unique sequence of connected nodes p(n 1,n k )=n 1,n 2,…,n k where ◦ a weighted tree has edges with associated real numbers as weights

 Leaf-based approaches measure the similarity of trees T 1, T 2 based on their contained leaves L(T 1 ) and L(T 2 ).

 it reflects the inner structure of the tree

01

 The consensus tree provides a compact form of a 1:n comparison between one reference tree and all other trees. highlighted by the user

Reference treeCompared similar tree Compared dissimilar tree

 those subtrees are collapsed that have element scores below a userdefined threshold  structures similar to the reference tree are hidden and dissimilarities are pointed out

 a new approach for visual comparison of multiple trees  it supports evaluating both global and local patterns among trees  combined algorithmic calculation with interactive data visualization ◦ computation of (sub)tree similarity is based on a new distance measure  not only for comparing phylogenetic trees but also for other problems such as evaluating results of hierarchic clustering with differing parameter settings.