Accelerating sequence searching: dimensionality reduction method

作者：Song Guojie^*; Cui Bin; Zheng Baihua; Xie Kunqing; Yang Dongqing

来源：Knowledge and Information Systems, 2009, 20(3): 301-322.

DOI：10.1007/s10115-008-0180-0

• Sequence similarity search
• Sequence embedding
• Index
• Dimension reduction

Similarity search over long sequence dataset becomes increasingly popular in many emerging applications, such as text retrieval, genetic sequences exploring, etc. In this paper, a novel index structure, namely Sequence Embedding Multiset tree (SEM - tree), has been proposed to speed up the searching process over long sequences. The SEM-tree is a multi-level structure where each level represents the sequence data with different compression level of multiset, and the length of multiset increases towards the leaf level which contains original sequences. The multisets, obtained using sequence embedding algorithms, have the desirable property that they do not need to keep the character order in the sequence, i.e. shorter representation, but can reserve the majority of distance information of sequences. Each level of the tree serves to prune the search space more efficiently as the multisets utilize the predicability to finish the searching process beforehand and reduce the computational cost greatly. A set of comprehensive experiments are conducted to evaluate the performance of the SEM-tree, and the experimental results show that the proposed method is much more efficient than existing representative methods.

• 出版日期2009-9
• 单位北京大学