Advanced SearchSearch Tips
Mining Maximal Frequent Contiguous Sequences in Biological Data Sequences
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Mining Maximal Frequent Contiguous Sequences in Biological Data Sequences
Kang, Tae-Ho; Yoo, Jae-Soo; Kim, Hak-Yong; Lee, Byoung-Yup;
  PDF(new window)
Biological sequences such as DNA and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of more than hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological datasets with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with a fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. The experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.
Sequence Pattern Mining;Sequence Analysis;Motif Finding Problem;Bioinformatics;
 Cited by