The algorithm uses top down approach and generates the longest possible candidate sequences. Frequent sequence mining is a fundamental and essential operation in the process of discovering the sequential rules. Most of the sequence mining algorithms use apriori methodology or build the larger sequences from smaller patterns, a bottom-up approach. In this paper, the authors present an algorithm that uses top-down approach for mining long sequences. Their algorithm defines dominancy of the sequences and uses it for minimizing the scanning of the data set.