Case study: Visualizing sets of evolutionary trees

被引:51
作者
Amenta, N [1 ]
Klingner, J [1 ]
机构
[1] Univ Texas, Dept Comp Sci, Austin, TX 78712 USA
来源
INFOVIS 2002: IEEE SYMPOSIUM ON INFORMATION VISUALIZATION 2002 | 2002年
关键词
D O I
10.1109/INFVIS.2002.1173150
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We describe a visualization tool which allows a biologist to explore a large set of hypothetical evolutionary trees. Interacting with such a dataset allows the biologist to identify distinct hypotheses about how different species or organisms evolved, which would not have been clear from traditional analyses. Our system integrates a point-set visualization of the distribution of hypothetical trees with detail views of an individual tree, or of a consensus tree summarizing a subset of trees. Efficient algorithms were required for the key tasks of computing distances between trees, finding consensus trees, and laying out the point-set visualization.
引用
收藏
页码:71 / 74
页数:4
相关论文
共 15 条
[1]  
ALLEN B, IN PRESS ANN COMBINA
[2]   BRUSHING SCATTERPLOTS [J].
BECKER, RA ;
CLEVELAND, WS .
TECHNOMETRICS, 1987, 29 (02) :127-142
[3]  
Borg I., 1997, MODERN MULTIDIMENSIO
[4]  
BUJA A, IN PRESS J COMPUTATI
[5]  
Buja Andreas, 1996, Journal of Computational and Graphical Statistics, V5, P78, DOI [DOI 10.1080/10618600.1996.10474696, 10.2307/1390754, DOI 10.2307/1390754]
[6]   A linear iteration time layout algorithm for visualising high-dimensional data [J].
Chalmers, M .
VISUALIZATION '96, PROCEEDINGS, 1996, :127-+
[7]   OPTIMAL-ALGORITHMS FOR COMPARING TREES WITH LABELED LEAVES [J].
DAY, WHE .
JOURNAL OF CLASSIFICATION, 1985, 2 (01) :7-28
[8]  
Eick S. G., 1993, Proceedings Visualization '93. (Cat. No.93CH3354-8), P204, DOI 10.1109/VISUAL.1993.398870
[9]  
He X, 1997, PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P427
[10]  
Maddison D, 2000, MACCLADE VERSION 4 A