A fast technique for constructing evolutionary tree with the application of compact sets

Kun Ming Yu*, Yu Weir Chang, Yao Hua Yang, Jiayi Zhou, Chun Yuan Lin, Chuan Yi Tang

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

Abstract

Constructing an evolutionary tree has many techniques, and usually biologists use distance matrix on this activity. The evolutionary tree can assist in taxonomy for biologists to analyze the phylogeny. In this paper, we specifically employ the compact sets to convert the original matrix into several small matrices for constructing evolutionary tree in parallel. By the properties of compact sets, we do not spend much time and do keep the correct relations among species. Besides, we adopt both Human Mitochondrial DNAs and randomly generated matrix as input data in the experiments. In comparison with conventional technique, the experimental results show that utilizing compact sets can definitely construct the evolutionary tree in a reasonable time.

Original languageEnglish
Pages (from-to)346-354
Number of pages9
JournalLecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
Volume3606
DOIs
StatePublished - 2005
Externally publishedYes
Event8th International Conference on Parallel Computing Technologies, PaCT 2005 - Krasnoyarsk, Russian Federation
Duration: 05 09 200509 09 2005

Keywords

  • Branch-and-bound
  • Compact sets
  • Computational biology
  • Evolutionary tree

Fingerprint

Dive into the research topics of 'A fast technique for constructing evolutionary tree with the application of compact sets'. Together they form a unique fingerprint.

Cite this