Related Experiment Video
Updated: May 9, 2026

Mining Spatial Transcriptomics Datasets using DeepSpaceDB
Published on: September 5, 2025
MAIL: mining sequential patterns with wildcards
Fei Xie1, Xindong Wu, Xuegang Hu
1College of Computer Science and Information Engineering, Hefei University of Technology, Hefei 230009, China. xiefei9815057@sina.com
Abstract:
Sequential pattern mining is an important research task in many domains, such as biological science. In this paper, we study the problem of mining frequent patterns from sequences with wildcards. The user can specify the gap constraints with flexibility. Given a subject sequence, a minimal support threshold and a gap constraint, we aim to find frequent patterns whose supports in the sequence are no less than the given support threshold. We design an efficient mining algorithm MAIL. Two pattern growth strategies are proposed to improve the completeness and the time efficiency. One is based on the candidate occurrence pruning, and the other uses an occurrence graph. A random data generator is designed to test the completeness on artificial data. Experiments on DNA sequences show that MAIL mines four times more patterns than one of its peers and the time performance is six times faster on average than its another peer. We also give a concrete example in which our algorithm is applied on DNA sequences to find interesting patterns.
Related Concept Videos
Wald-Wolfowitz Runs Test I
The test works...
Multi-species Conserved Sequences
Although the genome of each species varies greatly from each other, a few sequences are highly conserved. Such conserved DNA...
¹H NMR Signal Multiplicity: Splitting Patterns
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Applications of Molecular Taxonomy
Wald-Wolfowitz Runs Test II
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and 0s. In...

