{"title":"An Efficient Ant Colony Algorithm for Multiple Sequences Alignment","authors":"Ling Chen, Lingjun Zou, Juan Chen","doi":"10.1109/ICNC.2007.189","DOIUrl":null,"url":null,"abstract":"A multiple sequence alignment algorithm based on divide-and-conquer method and ant colony algorithms is proposed. In the algorithm, ant colony optimization method is used to partition the set of sequences into several subsections vertically. Then the procedure of partitioning is applied to the prefix family and the suffix family in a recursive manner until the lengths of the subsequences are all equal to 1. Experimental results show that the algorithm can get high quality solution and reduce the running time.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Conference on Natural Computation (ICNC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2007.189","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
A multiple sequence alignment algorithm based on divide-and-conquer method and ant colony algorithms is proposed. In the algorithm, ant colony optimization method is used to partition the set of sequences into several subsections vertically. Then the procedure of partitioning is applied to the prefix family and the suffix family in a recursive manner until the lengths of the subsequences are all equal to 1. Experimental results show that the algorithm can get high quality solution and reduce the running time.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
