Compressed Feature-based Filtering and Verification Approach for Subgraph Search. EDBT (2013) 287-298. Efficiently using Prime-Encoding for Frequent Itemsets Mining in Sparse Data. Computing and Informatics, 32(5)(2013), 1079--1099. Prism: An effective approach for frequent sequence mining via prime-block encoding. Journal of Computer and System Sciences 76 (2010) 88–102 Efficiently Mining Maximal Frequent Itemsets. ICDM 2001 Fast Vertical Mining Using Diffsets. KDD 2003 PreJoin: An Efficient Trie-based String Similarity Join Algorithm An Improved Global Lower Bound For Graph Edit Similarity Search. Pattern Recognition Letters 58 (2015) 8-14. GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets. Data Mining and Knowledge Discovery, 11, 1–20, 2005 FAST-ON*: AN EXTENDED ALGORITHM FOR GRAPH ISOMORPHISM PROBLEM AND GRAPH QUERY PROCESSING A fast algorithm for subgraph search problem DASS: a discovery agent supporting system. IEEE SMC'99. Using relevant reasoning to solve the relevancy problem in knowledge discovery in databases. IEEE SMC'98 Prism: A primal-encoding approach for frequent sequence mining. ICDM07 Mining sequential patterns in dense databases CSI_GED: An Efficient Approach for Graph Edit Similarity Computation. ICDE 2016. pp. 265--276. An efficient string edit similarity join algorithm. Computing and Informatics 36,(3):683–704 · June 2017 BFST_ED: A novel upper bound computation framework for the graph edit distance. SISAP 2016, pp. 3-19. A novel hierarchical-based framework for upper bound computation of graph edit distance, Pattern Recognition 80 (2018) 210–224 A Novel Edge-centric Approach for Graph Edit Similarity Computation. Information Systems 80 (2019) 91–106. New Subgraph Isomorphism Algorithms: Vertex versus Path-at-a-time Matching. arXiv preprint arXiv:1904.08819 A Fast and Efficient Algorithm for Outlier Detection Over Data Streams