Skip to main content

Table 1 Matrix representation and relationship matrix

From: Split-based computation of majority-rule supertrees

Matrix representation

 

s 1

s 2

s 3

s 4

s 5

g 1

g 2

A

1

1

1

0

0

-

-

B

1

1

1

0

0

-

-

C

0

1

1

0

0

0

0

D

0

0

1

0

0

1

0

E

0

0

0

0

0

-

-

F

0

0

0

1

0

1

0

G

0

0

0

1

1

0

1

H

0

0

0

1

1

0

1

Relationship matrix

 

s 1

s 2

s 3

s 4

s 5

c i

 

g 1

c

c

i

i

c

1

 

g 2

c

c

c

c

s

0

 

b j

0

0

1

1

0

  
  1. Coding of the example trees in Figure 1. Only inner splits are shown.