longest common subsequence 中文意思是什麼
longest common subsequence
解釋
最大共同子序列- longest : 朗格斯特
- common : adj 1 共通的，共同的，共有的。2 公眾的；公共的。3 普通的，通常的，尋常的，平常的。4 平凡的，通俗...
- subsequence : n. 接續；緊隨…之後；隨后發生的事情；後果。
-
Finally, the ability of applying the approved aco algorithm to msa is studied. the idea of divide - and - conquer is adopted to improving the progressive algorithm and the longest common subsequence of multiple sequences is proposed as the partition points of multiple sequences. also, the paper presents how to solve the longest common subsequence of multiple sequences by the approved aco algorithm for mcp
最後，本文對改進的蟻群優化演算法在多序列比對問題上的應用進行了研究，採取分治思想改進現有的progressive演算法，提出利用最長公共子序列進行多序列分割的策略，並給出怎樣利用解決最大團問題的蟻群優化演算法求解多序列的最長公共子序列的方法。
分享友人