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 language | English |
---|---|
Pages (from-to) | 346-354 |
Number of pages | 9 |
Journal | Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) |
Volume | 3606 |
DOIs | |
State | Published - 2005 |
Externally published | Yes |
Event | 8th International Conference on Parallel Computing Technologies, PaCT 2005 - Krasnoyarsk, Russian Federation Duration: 05 09 2005 → 09 09 2005 |
Keywords
- Branch-and-bound
- Compact sets
- Computational biology
- Evolutionary tree