Skip to main content

Table 4 Coding of modified example trees

From: Split-based computation of majority-rule supertrees

Matrix representation

Relationship matrix

 

s 1

s 2

s 3

s 4

s 5

s 6

s 7

s 8

s 9

g 1

g 2

g 3

g 4

g 5

g 6

g 7

 

s 1

s 2

s 3

s 4

s 5

s 6

s 7

s 8

s 9

c i

A'

1

1

0

0

0

0

0

0

0

-

-

-

-

-

-

-

g 1

c

i

i

c

c

c

c

c

c

1

C

1

1

0

0

1

0

0

0

0

0

0

1

0

0

0

0

g 2

c

c

c

s

c

c

c

c

c

0

D

0

1

0

0

0

1

0

0

0

1

0

0

1

0

0

0

g 3

s

c

c

c

s

c

c

c

c

0

E

0

0

0

0

0

0

0

0

0

-

-

-

-

-

-

-

g 4

c

c

c

c

c

s

c

c

c

0

F

0

0

1

0

0

0

1

0

0

1

0

0

0

1

0

0

g 5

c

c

c

c

c

c

s

c

c

0

G

0

0

1

1

0

0

0

1

0

0

1

0

0

0

1

0

g 6

c

c

c

c

c

c

c

s

c

0

H

0

0

1

1

0

0

0

0

1

0

1

0

0

0

0

1

g 7

c

c

c

c

c

c

c

c

s

0

                 

b j

0

1

1

0

0

0

0

0

0

Â