Frequent patter mining has been around ever since the data mining domain came into popularity. However, there was an argument in this domain that one should min only closed frequent patterns instead of mining all frequent patterns. The reason being that the former gives rise to very compact and efficient result set. The drawback of most of the existing closed sequence mining algorithms is that they rely on an approach known as candidate maintenance-and-test. This paper is costly in terms of memory usage and the time taken.