arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0904.1242cs.DScs.DCcs.DM
收藏

多序列集的分布与沉积算法

The Distribution and Deposition Algorithm for Multiple Sequences Sets

Kang Ning, Hon Wai Leong

摘要:

序列集是一种应用广泛的数学模型。随着序列数量的增加,单序列集模型已不适合于快速增长的问题规模。例如,越来越多的文本处理应用程序在处理之前将单个大文本文件分成多个文件。对于这些应用,强调的数学模型是多序列集(MSS)。虽然MSS的使用越来越多,但对如何有效地处理MSS的研究却很少。为了处理多个序列集,首先将序列分配到不同的集合,然后处理每个集合的序列。推导出有效的MSS处理算法是一个既有趣又具有挑战性的问题。在本文中,我们定义了成本函数和性能比的综合序列的质量分析。在此基础上,提出了多序列集处理(PMSS)问题。首先,我们提出了两个贪心算法的PMSS问题,这是基于单序列集算法的推广。然后在分析多序列集特点的基础上,提出了求解PMSS问题的DDA算法和DDA* 算法。在DDA算法中,首先将序列按其字母表内容分配到多个集合中,然后对每个集合中的序列进行沉积算法沉积。DDA* 算法与DDA算法的不同之处在于DDA* 算法通过基于序列谱的聚类来分布序列。实验结果表明,DDA和DDA* 总是以比其他算法更小的代价输出结果,并且DDA* 在大多数情况下优于DDA。DDA和DDA* 算法在时间和空间上也是有效的。

英文摘要:

Sequences set is a mathematical model used in many applications. As the number of the sequences becomes larger, single sequence set model is not appropriate for the rapidly increasing problem sizes. For example, more and more text processing applications separate a single big text file into multiple files before processing. For these applications, the underline mathematical model is multiple sequences sets (MSS). Though there is increasing use of MSS, there is little research on how to process MSS efficiently. To process multiple sequences sets, sequences are first distributed to different sets, and then sequences for each set are processed. Deriving effective algorithm for MSS processing is both interesting and challenging. In this paper, we have defined the cost functions and performance ratio for analysis of the quality of synthesis sequences. Based on these, the problem of Process of Multiple Sequences Sets (PMSS) is formulated. We have first proposed two greedy algorithms for the PMSS problem, which are based on generalization of algorithms for single sequences set. Then based on the analysis of the characteristics of multiple sequences sets, we have proposed the Distribution and Deposition (DDA) algorithm and DDA* algorithm for PMSS problem. In DDA algorithm, the sequences are first distributed to multiple sets according to their alphabet contents; then sequences in each set are deposited by the deposition algorithm. The DDA* algorithm differs from the DDA algorithm in that the DDA* algorithm distributes sequences by clustering based on sequence profiles. Experiments show that DDA and DDA* always output results with smaller costs than other algorithms, and DDA* outperforms DDA in most instances. The DDA and DDA* algorithms are also efficient both in time and space.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑