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 |
id |
ndltd-TW-092MCU00392005 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-092MCU003920052018-04-27T04:28:41Z http://ndltd.ncl.edu.tw/handle/en6dhp Meta-heuristics for Phylogenetic Tree Construction 運用多用途經驗法則建構演化樹 Cheng-Kang Huang 黃正綱 碩士 銘傳大學 資訊工程學系碩士班 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. Hsiung-Chien Hsu 徐熊健 2004 學位論文 ; thesis 69 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 銘傳大學 === 資訊工程學系碩士班 === 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.
|
author2 |
Hsiung-Chien Hsu |
author_facet |
Hsiung-Chien Hsu Cheng-Kang Huang 黃正綱 |
author |
Cheng-Kang Huang 黃正綱 |
spellingShingle |
Cheng-Kang Huang 黃正綱 Meta-heuristics for Phylogenetic Tree Construction |
author_sort |
Cheng-Kang Huang |
title |
Meta-heuristics for Phylogenetic Tree Construction |
title_short |
Meta-heuristics for Phylogenetic Tree Construction |
title_full |
Meta-heuristics for Phylogenetic Tree Construction |
title_fullStr |
Meta-heuristics for Phylogenetic Tree Construction |
title_full_unstemmed |
Meta-heuristics for Phylogenetic Tree Construction |
title_sort |
meta-heuristics for phylogenetic tree construction |
publishDate |
2004 |
url |
http://ndltd.ncl.edu.tw/handle/en6dhp |
work_keys_str_mv |
AT chengkanghuang metaheuristicsforphylogenetictreeconstruction AT huángzhènggāng metaheuristicsforphylogenetictreeconstruction AT chengkanghuang yùnyòngduōyòngtújīngyànfǎzéjiàngòuyǎnhuàshù AT huángzhènggāng yùnyòngduōyòngtújīngyànfǎzéjiàngòuyǎnhuàshù |
_version_ |
1718632811118723072 |