Candidate Gene Prioritization Using Unique Pattern Indexing and Mapping Techniques

Mutakabbir, Kazi Mahbub; Mahin, Shah S

dc.contributor.author	Mutakabbir, Kazi Mahbub
dc.contributor.author	Mahin, Shah S
dc.date.accessioned	2021-09-16T05:08:16Z
dc.date.available	2021-09-16T05:08:16Z
dc.date.issued	2014-11-15
dc.identifier.citation	[1] Shuang Bai, Si-Xue Bai, “The Maximal Frequent Pattern Mining of DNA Sequence”, GrC, pp 23-26, 2009. [2] A Fast Contiguous Sequential Pattern Mining Technique in DNA Data Sequences Using Position Information Syeda Farzana Zerin, Byeong-Soo Jeong Department of Computer Engineering, Kyung Hee University, 1 Seocheon-dong, Giheung-gu, Yongin-si, Gyeonggi-do, 446-701, Korea Date of Web Publication 12-Dec-2011 [3] Mining Maximal Adjacent Frequent Patterns from DNA Sequences using Location Information Moin Mahmud Tanvee, Shaikh Jeeshan Kabeer, Tareque Mohmud Chowdhury, Asif Ahmed Sarja, Md. Tayeb Hasan Shuvo, Department of CSE. [4] T.H Kang, J.S Yoo and H, Y Kim, “Mining frequent contiguous sequence patterns in biological sequences”, in proceeding of the 7th IEEE International Conference on Bioinformatics and Bioengineering, pp 723-8, 2007. [5] R. Agrawal and R. Srikant, “Fast algorithms for mining association rules.” In Proc. 1994 Int. Conf. Very Large Databases (VLDB?94), pages 487–499, Santiago, Chile, Sept. 1994. [6] R. Srikant, and R. Agrwal, "Mining sequential patterns: generalizations and performance improvements", in Proceedings of 5 th International Conference on Extending Database Technology (EDBT'96), Avignon, France, pp. 3-17, Mar. 1996. [7] J. Pan, P. Wang, W. Wang, B. Shi, and G. Yang, "Efficient algotithms for mining maximal frequent concatenate sequences in biological datasets", in Proceedings of the Fifth International Conference on Computer and Information Technology(CIT), pp. 98-104, 2005. [8] Notable uses of Data mining- Wikipedia. [9] Bioinformatics and the Internet-Andreas D. Baxevanis. [10] Charles E. Leiserson, Amortized Algorithms, Table Doubling, Potential Method Lecture 13, course MIT 6.046J/18.410J Introduction to Algorithms – Fall 2005. [11] Shuguang Wang , Milos Hauskrecht Gene Prioritization Using a Probabilistic Knowledge Model. [12] E. A. Adie, R. R. Adams, K. L. Evans, D. J. Porte-ous, and B. S. Pickard. Suspects: enabling fast and effective prioritization of positional candidates. BMC Bioinformatics, 22(6):773–774, 2006. [13] J. M. Kleinberg. Authoritative sources in a hyperlinked environment. The Journal of ACM, 46(5):604–632, 1999 [14] L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical Report, 1998. Page \| 37 [15] Page L, Brin S, Motwani R, Winograd T (1999) The PageRank Citation Ranking: Bringing Order to the Web. Technical Report. [16] Kleinberg JM (1999) Authoritative sources in a hyperlinked environment. Journal of the ACM 46: 604–632. doi: 10.1145/324133.324140 [17] An Algorithm for Network-Based Gene Prioritization That Encodes Knowledge Both in Nodes and in Links. Chad Kimmel mail, Shyam Visweswaran Published: November 19, 2013 DOI: 10.1371/journal.pone.0079564 [18] "Facts about Google and Competition". Archived from the original on 4 November 2011. Retrieved 12 July 2014. [19] Fisher D., Smyth P., Boey Y. B. and White S.; “Analysis and Visualization of Network Data using JUNG”; Journal of Statistical Software, pp 136-170, Issue II. [20] Dempster-Shafer Theory for Intrusion Detection- Thomas M Chen Varadharajan.	en_US
dc.identifier.uri	http://hdl.handle.net/123456789/1002
dc.description	Supervised by Md. Abid Hasan, Lecturer, Department of Computer Science and Engineering (CSE), Islamic University of Technology (IUT), Board Bazar, Gazipur-1704, Bangladesh.	en_US
dc.description.abstract	“Prioritizing the candidate gene is amongst the notable work in bioinformatics. Techniques have been applied to reduce the number of promising genes for a certain disease. Previous works were done by using PageRank and HITS algorithm on graph based network. However using frequent pattern mining this prioritizing can be made more efficient. In this paper, we propose four algorithms. The first one indexes the unique sequences of length four using an integer value. The second algorithm finds the frequency of the frequent patterns of various lengths by searching through the integer values instead of the patterns themselves. Third one weights the candidate gene in compare with the genes of database. Fourth algorithm creates the graph network and ranks the candidate gene. All this is done highly efficiently by the use of mapping techniques e.g. HashMap. Due to its highly frugal nature, the proposed algorithm can reduce typical memory usage by 37.5% at the very minimum.”	en_US
dc.language.iso	en	en_US
dc.publisher	Department of Computer Science and Engineering (CSE), Islamic University of Technology (IUT), Board Bazar, Gazipur-1704, Bangladesh	en_US
dc.title	Candidate Gene Prioritization Using Unique Pattern Indexing and Mapping Techniques	en_US
dc.type	Thesis	en_US