Table 1

Hybridization networks used in simulations.

ID

H

S

Principle trees (given in Newick format)


1

0

5

(((a,b),(c,d)),((e,f),(g,h)));

2

1

8

(((a,b),(c,d)),((e,f),(g,h))); (((a,b),c),(((e,d),f),(g,h)));

3

1

7

(((a,b),(c,d)),((e,f),(g,h))); (((a,(b,d)),c),((e,f),(g,h)));

4

0

5

(((((((a,b),c),d),e),f),g),h);

5

1

7

(((((((a,b),c),d),e),f),g),h); ((((((a,c),(b,d)),e),f),g),h);

6

1

10

(((((((a,b),c),d),e),f),g),h); ((((((a,c),d),e),f),(g,b)),h);

7

2

8

(((a,b),(c,d)),((e,f),(g,h))); (((a,b),(c,d)),(((e,f),g),h));

((a,((b,c),d)),((e,f),(g,h))); ((a,((b,c),d)),(((e,f),g),h));

8

2

9

(((a,b),(c,d)),((e,f),(g,h))); (((a,b),c),(((d,e),f),(g,h)));

((((a,b),(g,h)),(c,d)),(e,f)); ((((a,b),(g,h)),c),((d,e),f));

9

3

9

((((a,b),(c,d)),(e,f)),(g,h)); ((((a,b),(c,d)),e),(f,(g,h)));

(((a,b),(c,d)),((e,f),(g,h))); (((a,b),(c,d)),(e,(f,(g,h))));

((((a,b),c),(d,(e,f))),(g,h)); ((((a,b),c),(d,e)),(f,(g,h)));

(((a,b),c),((d,(e,f)),(g,h))); (((a,b),c),((d,e),(f,(g,h))));

10

3

24

((((b,e),(a,c)),((d,f),g)),h); (((b,(a,c)),((e,g),(d,f))),h);

(((a,(b,e)),(((c,d),f),g)),h); (((a,b),(((c,d),f),(e,g))),h);

(((a,c),((((b,e),d),f),g)),h); (((a,c),(((b,d),f),(e,g))),h);

((a,((((b,e),(c,d)),f),g)),h); ((a,(((b,(c,d)),f),(e,g))),h);


The column H gives the number of hybridization events, and the column S gives the number of unique non-trivial splits contained in the principal trees.

Holland et al. BMC Evolutionary Biology 2008 8:202   doi:10.1186/1471-2148-8-202

Open Data