LemK_MSA: A multiple sequence alignment method with sequence vectorization based on Lempel-Ziv | |
Ji, Guoli ; Yao, Jingci ; Yang, Zijiang ; Ye, Congting ; Ji GL(吉国力) | |
2013 | |
关键词 | Algorithms Forestry Trees (mathematics) |
英文摘要 | Conference Name:2nd International Conference on Engineering and Technology Innovation 2012, ICETI 2012. Conference Address: Kaohsiung, Taiwan. Time:November 2, 2012 - November 6, 2012.; AandF; Tailift Co., Ltd; SPINTECH; Smart Motion Control Co.,Ltd.; FXB Flexible Motion; et al; In this paper, we propose a method for multiple sequence alignment, LemK_MSA, which integrates Lempel-Ziv based sequence vectorization and k-means clustering analysis. LemK_MSA converts multiple sequence alignment into corresponding 10-dimensional vector alignment by 10 types of copy modes. Then it uses k-means algorithm and NJ algorithm to divide the sequences into several groups and calculate guide tree of each part with the vectors of the sequences. A complete guide tree for multiple sequence alignment could be constructed by merging guide tree of every group. Thus, the time efficiency of processing multiple sequence alignment, especially for large-scale sequences, can be improved. The high-throughput mouse antibody sequences are used to validate the proposed method. Compared to ClustalW, MAFFT and Mbed, LemK_MSA is more than ten times efficient while ensuring the alignment accuracy at the same time. LemK_MSA also provides an effective method to analyze the evolutionary relationship and structural features among high-throughput sequences. ? (2013) Trans Tech Publications, Switzerland. |
语种 | 英语 |
出处 | http://dx.doi.org/10.4028/www.scientific.net/AMM.284-287.3203 |
出版者 | Trans Tech Publications |
内容类型 | 其他 |
源URL | [http://dspace.xmu.edu.cn/handle/2288/86595] |
专题 | 信息技术-会议论文 |
推荐引用方式 GB/T 7714 | Ji, Guoli,Yao, Jingci,Yang, Zijiang,et al. LemK_MSA: A multiple sequence alignment method with sequence vectorization based on Lempel-Ziv. 2013-01-01. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论