### Abstract

While it is straightforward to calculate the bounding ball of a partially resolved phylogenetic tree, the calculation of the cardinality of the grand bounding ball for multiple partially resolved trees is very time-consuming due to the power set principle that governs the highly iterative calculation process. What can further complicate the calculation is that the practitioner has to possess domain knowledge in phylogenetic trees, subtree mining and discrete math at the same time. This paper presents the first efficient software to automate the process of calculating the cardinality of the grand bounding ball by combining a number of advanced data mining techniques and concepts including systematically growing intersection trees, which is specially defined for this work, level by level, cluster sets, Apriori, equivalence class, and set theory, and rooting unrooted trees etc. The algorithms are discussed in the the rooted tree scope first; then they are extended to the unrooted tree scope by using a novel directing method. In addition, a displayer component has been implemented to help visualize the complicated calculation process demanded by the problem. The software is expected to be useful in phylogenetic tree clustering research.

Original language | English |
---|---|

Title of host publication | Proceedings of the 2008 International Conference on Data Mining, DMIN 2008 |

Editors | R. Stahlbock, S.F. Crone, S. Lessmann |

Pages | 529-535 |

Number of pages | 7 |

State | Published - 1 Dec 2008 |

Event | 2008 International Conference on Data Mining, DMIN 2008 - Las Vegas, NV, United States Duration: 14 Jul 2008 → 17 Jul 2008 |

### Other

Other | 2008 International Conference on Data Mining, DMIN 2008 |
---|---|

Country | United States |

City | Las Vegas, NV |

Period | 14/07/08 → 17/07/08 |

### Fingerprint

### Keywords

- Aprori
- Data mining
- Equivalence class
- Phylogenetic trees
- Software

### Cite this

*Proceedings of the 2008 International Conference on Data Mining, DMIN 2008*(pp. 529-535)

}

*Proceedings of the 2008 International Conference on Data Mining, DMIN 2008.*pp. 529-535, 2008 International Conference on Data Mining, DMIN 2008, Las Vegas, NV, United States, 14/07/08.

**Algorithms and software for calculating and visualizing the cardinality of the grand bounding ball by means of intersection trees.** / Barton, Robert; Zhang, Sen; Herbert, Katherine.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

TY - GEN

T1 - Algorithms and software for calculating and visualizing the cardinality of the grand bounding ball by means of intersection trees

AU - Barton, Robert

AU - Zhang, Sen

AU - Herbert, Katherine

PY - 2008/12/1

Y1 - 2008/12/1

N2 - While it is straightforward to calculate the bounding ball of a partially resolved phylogenetic tree, the calculation of the cardinality of the grand bounding ball for multiple partially resolved trees is very time-consuming due to the power set principle that governs the highly iterative calculation process. What can further complicate the calculation is that the practitioner has to possess domain knowledge in phylogenetic trees, subtree mining and discrete math at the same time. This paper presents the first efficient software to automate the process of calculating the cardinality of the grand bounding ball by combining a number of advanced data mining techniques and concepts including systematically growing intersection trees, which is specially defined for this work, level by level, cluster sets, Apriori, equivalence class, and set theory, and rooting unrooted trees etc. The algorithms are discussed in the the rooted tree scope first; then they are extended to the unrooted tree scope by using a novel directing method. In addition, a displayer component has been implemented to help visualize the complicated calculation process demanded by the problem. The software is expected to be useful in phylogenetic tree clustering research.

AB - While it is straightforward to calculate the bounding ball of a partially resolved phylogenetic tree, the calculation of the cardinality of the grand bounding ball for multiple partially resolved trees is very time-consuming due to the power set principle that governs the highly iterative calculation process. What can further complicate the calculation is that the practitioner has to possess domain knowledge in phylogenetic trees, subtree mining and discrete math at the same time. This paper presents the first efficient software to automate the process of calculating the cardinality of the grand bounding ball by combining a number of advanced data mining techniques and concepts including systematically growing intersection trees, which is specially defined for this work, level by level, cluster sets, Apriori, equivalence class, and set theory, and rooting unrooted trees etc. The algorithms are discussed in the the rooted tree scope first; then they are extended to the unrooted tree scope by using a novel directing method. In addition, a displayer component has been implemented to help visualize the complicated calculation process demanded by the problem. The software is expected to be useful in phylogenetic tree clustering research.

KW - Aprori

KW - Data mining

KW - Equivalence class

KW - Phylogenetic trees

KW - Software

UR - http://www.scopus.com/inward/record.url?scp=62649156842&partnerID=8YFLogxK

M3 - Conference contribution

SN - 1601320620

SN - 9781601320629

SP - 529

EP - 535

BT - Proceedings of the 2008 International Conference on Data Mining, DMIN 2008

A2 - Stahlbock, R.

A2 - Crone, S.F.

A2 - Lessmann, S.

ER -