Abstract
The process of identifying the repeated contiguous patterns existing in a Big data environment, especially in a Sequence Database (SDB) is called Frequent Contiguous Patterns (FCP) mining. The existing FCP algorithms repeatedly scan the SDB to find FCP, which requires high time complexity and large storage space. In this paper, an Index based algorithm has been presented which minimizes the scanning time of SDB, while finding FCP in the SDB. We define IndexedFCP() which uses index based technique to divide the SDB into sub SDBs and helps directly to search the required FCP in its possible sub SDBs. FCP algorithms are used in many SDB applications such as finding Motif, Regulatory Regions and internal repeats in genomic SDB, identifying required items in Inventory SDB and finding trading patterns in stack trading etc.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
