HeurisFCP — A heuristic approach to Identify Frequent Contiguous Patterns (FCP) in Sequence Database

Identifying Frequent Contiguous Patterns(FCP) involvesfinding the frequently repeated contiguous pattern in Sequence Database (SDB). The existing FCP Algorithms have drawbacks of repeated scanning of Database which require high computation time and large storage space. In this paper, a heuristic algorithmhave been presented which minimizes scanning the time of the SDB and also provides clues for finding the FCP in a SDB. This Algorithm helpsin many SDB applications such as to extract Motif or Regulatory Regions in Genomic SDB, or to find repeated requiring items in the InventorySDBor to find stock trading patterns in Stock Trading SDB, etc.