VNU-UET Repository: No conditions. Results ordered -Date Deposited. 2024-03-28T08:25:37ZEPrintshttp://eprints.uet.vnu.edu.vn/images/sitelogo.pnghttps://eprints.uet.vnu.edu.vn/eprints/2020-12-10T03:41:08Z2020-12-10T03:41:08Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/4225This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/42252020-12-10T03:41:08ZiK-means: an improvement of the iterative k-means partitioning algorithmThu LeSy Vinh Levinhls@vnu.edu.vnDong Do Ducdongdd@vnu.edu.vnThang Buithangbn@vnu.edu.vnThao Nguyenthaontp@ioit.ac.vn2017-12-29T08:50:38Z2018-01-04T14:27:21Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/2892This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/28922017-12-29T08:50:38ZAnt colony optimization based founder sequence reconstructionReconstruction of founder (ancestor) genes for a given population is an important problem in evolutionary biology. It involves finding a set of genes that can combine together to form genes of all individuals in that population. Such reconstruction can be modeled as a combinatorial optimization problem, in which we have to find a set of founder (gene) sequences so that the individuals in a given population can be generated by the smallest number of recombination on these founder sequences. In this paper we propose a novel ant colony optimization algorithm (ACO) based method, equipped with some important improvements, for the founder gene sequence reconstruction problem. The proposed method yields excellent performance when validating on 108 test sets from three benchmark datasets. Comparing with the best by far method for founder sequence reconstruction, our proposed method performs better in 45 test sets, equally well in 44 and worse only in 19 sets. These experimental results demonstrate the efficacy and perspective of our proposed method.Anh Vu Thi NgocPhuc Thai DinhHoang Duc NguyenThanh Hai Danghai.dang@vnu.edu.vnDong Do Ducdongdd@vnu.edu.vn2013-08-23T02:25:29Z2013-08-23T02:25:29Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/186This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/1862013-08-23T02:25:29ZACOHAP: An Efficient Ant Colony Optimization for the Haplotype Inference by Pure Parsimony ProblemDong Do Ducdongdd@vnu.edu.vnSy Vinh Levinhls@vnu.edu.vnXuan-Huan Hoanghuanhx@vnu.edu.vn2013-08-08T06:30:59Z2015-01-22T07:05:02Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/184This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/1842013-08-08T06:30:59ZACOHAP: An Efficient Ant Colony Optimization for the Haplotype Inference by Pure Parsimony ProblemDong Do Ducdongdd@vnu.edu.vnSy Vinh Levinhls@vnu.edu.vnXuan-Huan Hoanghuanhx@vnu.edu.vn