DocumentCode :
3252616
Title :
HeurisFCP — A heuristic approach to Identify Frequent Contiguous Patterns (FCP) in Sequence Database
Author :
Rajasekaran, Sanguthevar ; Arockiam, L.
Author_Institution :
R&D Centre, Bharathiar Univ., Coimbatore, India
fYear :
2012
fDate :
21-22 Dec. 2012
Firstpage :
137
Lastpage :
142
Abstract :
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.
Keywords :
data mining; database management systems; pattern classification; FCP algorithms; Genomic SDB; HeurisFCP; Inventory SDB; SDB scanning time minimization; Stock Trading SDB; contiguous pattern mining; frequent contiguous pattern identification; heuristic approach; motif extraction; regulatory region extraction; sequence database; stock trading patterns; Algorithm design and analysis; Bioinformatics; DNA; Heuristic algorithms; Itemsets; Contiguous Pattern Mining; DNA Data Sequences; Motif; Regulatory Regions; Sequence Database; Stock Trading Pattern;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Radar, Communication and Computing (ICRCC), 2012 International Conference on
Conference_Location :
Tiruvannamalai
Print_ISBN :
978-1-4673-2756-5
Type :
conf
DOI :
10.1109/ICRCC.2012.6450563
Filename :
6450563
Link To Document :
بازگشت