Meta-heuristics for Phylogenetic Tree Construction
碩士 === 銘傳大學 === 資訊工程學系碩士班 === 92 === Phylogeny reconstruction is an important yet difficult problem in computational biology, because the solution space increases exponentially with the number of the taxa considered. The NP-hardness of the phylogeny inference drives the researchers to use clustering...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/en6dhp |
| Summary: | 碩士 === 銘傳大學 === 資訊工程學系碩士班 === 92 === Phylogeny reconstruction is an important yet difficult problem in computational biology, because the solution space increases exponentially with the number of the taxa considered. The NP-hardness of the phylogeny inference drives the researchers to use clustering algorithms or heuristic search strategies to construct near optimal solutions in a reasonable time. In this thesis, we propose meta-heuristic approaches including tabu search and ant colony optimization to resolve the phylogenetic tree construction problem under the minisize, minisum and miniSSE criteria. Experiment results reveal the effectiveness of using ant colony optimization algorithms to construct phylogenetic trees.
|
|---|