Skip to main content

Table 1 Number of solutions found by each one of the programs CORE-PA, NOTUNG and EUCALYPT

From: EUCALYPT: efficient tree reconciliation enumerator

Dataset

Leaves

Cost vector

Reconciliations

 
 

H

P

 

CORE-PA

EUCALYPT

    

#T

#C

#A

#T

#C

#A

#CA

EC

7

10

〈0,1,1,1〉

16

6

10

16

6

10

5

   

〈0,1,2,1〉

14

0

14

18

0

18

6

   

〈0,2,3,1〉

12

0

12

16

0

16

4

GL

8

10

〈0,1,1,1〉

2

0

2

2

0

2

1

   

〈0,1,2,1〉

2

0

2

2

0

2

1

   

〈0,2,3,1〉

2

0

2

2

0

2

1

SC

11

14

〈0,1,1,1〉

1

0

1

1

0

1

1

   

〈0,1,2,1〉

1

0

1

1

0

1

1

   

〈0,2,3,1〉

1

0

1

1

0

1

1

RP

13

13

〈0,1,1,1〉

18

2

16

18

2

16

3

   

〈0,1,2,1〉

3

1

2

3

1

2

1

   

〈0,2,3,1〉

3

1

2

3

1

2

1

SFC

15

16

〈0,1,1,1〉

184

40

144

184

40

144

1

   

〈0,1,2,1〉

40

40

0

40

40

0

0

   

〈0,2,3,1〉

40

40

0

40

40

0

0

PLML

18

18

〈0,1,1,1〉

158

0

158

180

0

180

4

   

〈0,1,2,1〉

2

0

2

2

0

2

1

   

〈0,2,3,1〉

11

0

11

11

0

11

2

PLMP

18

18

〈0,1,1,1〉

2

0

2

2

0

2

1

   

〈0,1,2,1〉

2

0

2

2

0

2

1

   

〈0,2,3,1〉

17

0

17

18

0

18

2

RH

34

42

〈0,1,1,1〉

32

0

32

42

0

42

4

   

〈0,1,2,1〉

158

158

0

2208

2208

0

0

   

〈0,2,3,1〉

22

22

0

288

288

0

0

PP

36

41

〈0,1,1,1〉

1000*

0

1000

5120

0

5120

4

   

〈0,1,2,1〉

11

0

11

72

0

72

2

   

〈0,2,3,1〉

11

0

11

72

0

72

2

FD

20

51

〈0,1,1,1〉

1000*

282

718

25184

1792

23392

11

   

〈0,1,2,1〉

108

44

64

408

132

276

5

   

〈0,2,3,1〉

22

22

0

80

80

0

0

COG2085

100

44

〈0,1,1,1〉

1000*

0

1000

44544

2304

42240

3

   

〈0,1,2,1〉

1000*

0

1000

37568

480

37088

7

   

〈0,2,3,1〉

888

0

888

46656

0

46656

4

COG3715

100

40

〈0,1,1,1〉

1000*

1000

0

1172598

1155958

16640

6

   

〈0,1,2,1〉

9

9

0

9

9

0

0

   

〈0,2,3,1〉

13

13

0

33

33

0

0

COG4964

100

27

〈0,1,1,1〉

85

85

0

224

224

0

0

   

〈0,1,2,1〉

13

13

0

36

36

0

0

   

〈0,2,3,1〉

17

17

0

54

54

0

0

COG4965

100

30

〈0,1,1,1〉

1000*

408

592

17408

5632

11776

2

   

〈0,1,2,1〉

141

0

141

640

0

640

2

   

〈0,2,3,1〉

1000*

276

724

6528

1408

5120

2

  1. Number of solutions found by each one of the programs CORE-PA, NOTUNG and EUCALYPT for each dataset and each cost vector 〈c c ,c d ,c s ,c l 〉. For EUCALYPT and CORE-PA the columns represent: #T = total number of optimal solutions, #C = total number of cyclic solutions and #A = total number of acyclic solutions. In all cases #A is always equal for both NOTUNG and EUCALYPT. For EUCALYPT the column #CA denotes the number of event classes in the set of acyclic solutions. CORE-PA limits to 1000 the total number of enumerated solutions and these cases are denoted by the symbol ∗. Bold numbers indicate the cases where the number of solutions produced by CORE-PA differs from the one found by EUCALYPT.