Patterns regularly showing up in sequences give basic information to so main specialists, for example, atomic scientists, to find rules or patterns holed up behind the information. Because of the biological complex characteristic in the data items, designs once in a while precisely imitate and rehash themselves, yet rather show up with a somewhat unique shape in every form. In this paper, a gap limitation (additionally alluded to as a wildcard) which is a character and it is going to be replaced for the possible predefined character of a selected alphabet. I t processes adaptability to clients to catch valuable examples regardless of whether their appearances fluctuate in the sequences. So as to discover patt erns, existing apparatuses expect clients to expressly determine gap requirements in advance. In all actuality, it is regularly nontrivial or tedious for clients to give legitimate gap limitation esteems. What's more, a change made to the gap esteems may give totally unique outcomes, and require a different t edious re-mining system. In this manner, it is alluring to naturally and proficiently discover patterns without including client indicated gap prerequisites. The frequent subsequences at that point shape designs later on. Two heuristic techniques (one-way versus two-way checks) are proposed to find frequent subsequences and gauge their recurrence in the sequences. The test comes about on both engineered and true PROTEIN successions show the execution of the two strategies for the purpose of pattern recurrence estimation and frequent pattern mining. © IJSTR 2019.