Skip to main content

Table 6 Distributions of COGs by the number of events in the most parsimonious scenario depending on the gain penaltya

From: Algorithms for computing parsimonious evolutionary scenarios for genome evolution, the last universal common ancestor and dominance of horizontal gene transfer in the evolution of prokaryotes

Number of events

Gain penalty (g)

 

0.9

1.0

1.5

2.0

3.0

1

315

315

315

315

315

2

420

420

420

375

314

3

593

593

574

518

390

4

487

487

474

430

344

5

400

400

386

357

323

6

350

350

324

301

275

7

267

267

246

226

252

8

161

161

176

206

233

9

106

106

118

149

200

10

50

50

67

110

165

11

15

15

38

80

130

12

2

2

17

42

104

13

  

9

33

70

14

  

2

18

34

15

   

6

13

16

    

3

17

    

1

  1. aAll data are for the genome-tree topology.