Skip to main content

Table 2 Numerical comparison of a pair of parameter combinations that represents the variation observed between the different algorithms

From: The tree alignment problem

Subst.

Gap Op.

Branch Len.

Algorithm

Min.

Median

Max

1

0

0.05

Simulated

1.088

1.218

1.337

   

Fixed States

1.275

1.534

1.755

   

ADO

1.044

1.148

1.215

   

ADO + Iter.

1.044

1.123

1.202

1

0

0.3

Simulated

1.731

2.022

2.396

   

Fixed States

1.621

1.725

1.816

   

ADO

1.314

1.398

1.453

   

ADO + Iter.

1.300

1.377

1.393

4

3

0.05

Simulated

1.108

1.262

1.415

   

Fixed States

1.302

1.557

1.766

   

ADO

1.084

1.208

1.312

   

ADO + Iter.

1.067

1.171

1.283

4

3

0.3

Simulated

2.012

2.284

2.611

   

Fixed States

1.688

1.795

1.868

   

ADO

1.433

1.500

1.542

   

ADO + Iter.

1.388

1.442

1.453

  1. Each individual indel has cost 1.