treejuxtaposer

Post on 04-Jan-2016

23 Views

Category:

Documents

0 Downloads

Preview:

Click to see full reader

DESCRIPTION

TreeJuxtaposer. side by side comparison of evolutionary trees. Phylogenetic/Evolutionary Tree. M Meegaskumbura et al., Science 298:379 (2002). Common Dataset Size Today. M Meegaskumbura et al., Science 298:379 (2002). Future Goal: 10M node Tree of Life. Animals. Plants. You are here. - PowerPoint PPT Presentation

TRANSCRIPT

1

TreeJuxtaposer• side by side comparison of evolutionary trees

2

Phylogenetic/Evolutionary Tree

M Meegaskumbura et al., Science 298:379 (2002)

3

Common Dataset Size Today

M Meegaskumbura et al., Science 298:379 (2002)

4

Future Goal: 10M node Tree of Life

David Hillis, Science 300:1687 (2003)

Plants

Protists

Fungi

Animals

You arehere

5

Paper Comparison: Multiple Trees

focus

context

6

Accordion Drawing• rubber-sheet navigation

– stretch out part of surface, the rest squishes

– borders nailed down– Focus+Context technique

• integrated overview, details

– old idea• [Sarkar et al 93],

[Robertson et al 91]

• guaranteed visibility– marks always visible– important for scalability – new idea

• [Munzner et al 03]

77

Guaranteed Visibility

• marks are always visible• easy with small datasets

8

Guaranteed Visibility Challenges

• hard with larger datasets

• reasons a mark could be invisible

9

Guaranteed Visibility Challenges

• hard with larger datasets

• reasons a mark could be invisible– outside the window

• AD solution: constrained navigation

10

Guaranteed Visibility Challenges

• hard with larger datasets

• reasons a mark could be invisible– outside the window

• AD solution: constrained navigation

– underneath other marks• AD solution: avoid 3D

11

Guaranteed Visibility Challenges

• hard with larger datasets

• reasons a mark could be invisible– outside the window

• AD solution: constrained navigation

– underneath other marks• AD solution: avoid 3D

– smaller than a pixel• AD solution: smart culling

12

Guaranteed Visibility: Small Items

• Naïve culling may not draw all marked items

GV no GV

Guaranteed visibilityof marks

No guaranteed visibility

13

Guaranteed Visibility: Small Items

• Naïve culling may not draw all marked items

GV no GV

Guaranteed visibilityof marks

No guaranteed visibility

14

Structural Comparison

rayfinned fish

lungfish

salamander

frog

mammal

turtle

bird

crocodile

lizard

snake

rayfinned fish

bird

lungfish

salamander

frog

mammal

turtle

snake

lizard

crocodile

15

Matching Leaf Nodes

rayfinned fish

lungfish

salamander

frog

mammal

turtle

bird

crocodile

lizard

snake

rayfinned fish

bird

lungfish

salamander

frog

mammal

turtle

snake

lizard

crocodile

16

Matching Leaf Nodes

rayfinned fish

lungfish

salamander

frog

mammal

turtle

bird

crocodile

lizard

snake

rayfinned fish

bird

lungfish

salamander

frog

mammal

turtle

snake

lizard

crocodile

17

Matching Leaf Nodes

rayfinned fish

lungfish

salamander

frog

mammal

turtle

bird

crocodile

lizard

snake

rayfinned fish

bird

lungfish

salamander

frog

mammal

turtle

snake

lizard

crocodile

18

Matching Interior Nodes

rayfinned fish

lungfish

salamander

frog

mammal

turtle

bird

crocodile

lizard

snake

rayfinned fish

bird

lungfish

salamander

frog

mammal

turtle

snake

lizard

crocodile

19

Matching Interior Nodes

rayfinned fish

lungfish

salamander

frog

mammal

turtle

bird

crocodile

lizard

snake

rayfinned fish

bird

lungfish

salamander

frog

mammal

turtle

snake

lizard

crocodile

20

Matching Interior Nodes

rayfinned fish

lungfish

salamander

frog

mammal

turtle

bird

crocodile

lizard

snake

rayfinned fish

mammal

lungfish

salamander

frog

bird

turtle

snake

lizard

crocodile

21

Matching Interior Nodes

rayfinned fish

lungfish

salamander

frog

mammal

turtle

bird

crocodile

lizard

snake

rayfinned fish

bird

lungfish

salamander

frog

mammal

turtle

snake

lizard

crocodile

?

22

Similarity Score: S(m,n)

3

2)()(

)()(),(

FE,D,

FE,

nm

nmnm

LL

LLS

FE,D,n )(L FE,m )(L

T1 T2A

B

C

D

E

F

A

C

B

D

F

Em n

23

Best Corresponding Node

• – computable in O(n log2 n)– linked highlighting

T1 T2A

B

C

D

E

F

A

C

B

D

F

Em BCN(m) = n

1/32/3

2/6

00

0

0

0

0

1/2

1/2

)),(( vSv margmax)mBCN(2T

24

• – Matches intuition

1))BCN(,( whichfor Nodes vvS

Marking Structural DifferencesT1 T2A

B

C

D

E

F

A

C

B

D

F

Em n

25

TreeJuxtaposer• video, software from olduvai.sourceforge.net/tj

top related