1. Extending TreeJuxtaposer Nicholas Chen (nchen@cs.umd.edu)nchen@cs.umd.edu Maryam Farboodi (farboodi@cs.umd.edu)farboodi@cs.umd.edu May 9, 2006

2. Rendering Infrastructure Hierarchy of SplitLines segments each dimension of the screen Screen elements are bounded by pairs of SplitLines in each dimension Relatively positioned so updates propagate

3. Before and After Note how all nodes at a certain height are at the same horizontal position

4. Before and After SplitLines are created on the horizontal axis for each distance from the root

5. Pan and Zoom Interaction Stretching and squishing will distort the edge lengths Instead we implement panning and zooming Simulated!

6. Pan and Zoom Interaction Stretching and squishing will distort the edge lengths Instead we implement panning and zooming Simulated!

7. Structural Differences and : Phylogenetic trees and : Nodes Similarity score of and Best Corresponding Node (BCN) of Simplified Spanning Tree (SST) of in Influential factors: Topology (node placements) Edge lengths

8. Algorithm Objectives: Real time computation: Pre-processing time: Query time: Low space complexity: Algorithm: Identifying BCN for each node Computing necessary similarity scores for each node

9. Main Contribution Edge-length-based similarity score Force BCN of to be on SST of in Identifying BCN of For each node on SST of in Treat the intersecting node as a group Use the total weight of the subtree beneath Do not interact with leaves individually