Table 4

Summary of experiments on six host-parasite problem instances.

Tarzan

Jane

Problem

Tips

Min

Time

Min

Max

Mean

Mean Time


1

18

11

< 1 sec

11

11

11.0

11.4 sec


2

25

20

< 1 sec

20

20

20.0

40.6 sec


3

32

20

< 1 sec

20

20

20.0

44.0 sec


4

44

50+

< 1 sec

51

51

51.0

743.9 sec


5

54

44

< 1 sec

44

47

44.1

2166.8 sec


6

80

98*

< 1 sec

99

105

101.13

4473.6 sec


Key: The second column indicates the sum of the number of tips in the host and parasite trees. The columns labeled "Min" indicate the best solutions found. Since Jane uses randomness, the columns "Max" and "Mean" indicate the worst and average optimal solutions found over 30 independent runs. The Tarzan solution marked with + used a type of host switch not permitted in Jane and the solution marked with an asterisk was incorrect due to strong timing incompatibilities. All experiments were performed on a commodity iMac Intel Core 2 Duo computer with clock speed of 2.66 GHz and 4 GB memory.

Conow et al. Algorithms for Molecular Biology 2010 5:16   doi:10.1186/1748-7188-5-16

Open Data