Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.11861/7526
Title: | Efficient algorithm for mining correlated protein-DNA binding cores |
Authors: | Wong, Po-Yuen Chan, Tak-Ming Wong, Man-Hon Prof. LEUNG Kwong Sak |
Issue Date: | 2012 |
Source: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, Volume 7238 LNCS, Issue PART 1, Pages 470 - 4812012 17th International Conference on Database Systems for Advanced Applications |
Journal: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics |
Abstract: | Correlated protein-DNA interaction (binding cores) between transcription factor (TFs) and transcription factor binding sites (TFBSs) are usually identified by costly 3D structural experiments. To avoid numerous unsuccessful trials, we are motivated to develop a cheap and efficient sequence-based computational method for providing testable novel binding cores with high confidence to accelerate the experiments. Although there are abundant sequence-based motif discovery algorithms, few directly address associating both TF and TFBS core motifs which are both verifiable on 3D structures. In this paper, we formally define the problem of discovering correlated TF-TFBS binding cores, and apply association rule mining techniques over existing real sequence data (TRANSFAC). The proposed algorithm first builds two frequent sequence tree (FS-Tree) structures storing condensed information for association rule mining. Association rules are then generated by depth-first traversal on the structures. FS-Trees have several advantages to support further applications, including efficient calculation of the support and confidence, simple generation of candidate rules, and applicability of effective pruning techniques. As a result, the FS-Trees serve as a useful basis for more general extensions related to biological binding core identification. We tested our algorithm on real sequence data from the biological database TRANSFAC and focus on efficiency comparisons with the recent work employing association rule mining. The rules discovered reveal real TF-TFBS binding cores in independent 3D verifications on Protein Data Bank (PDB). © 2012 Springer-Verlag. |
Type: | Conference Paper |
URI: | http://hdl.handle.net/20.500.11861/7526 |
ISBN: | 978-364229037-4 |
ISSN: | 16113349 |
DOI: | 10.1007/978-3-642-29038-1_34 |
Appears in Collections: | Applied Data Science - Publication |
Find@HKSYU Show full item record
SCOPUSTM
Citations
3
checked on Nov 3, 2024
Page view(s)
37
Last Week
0
0
Last month
checked on Nov 13, 2024
Google ScholarTM
Impact Indices
Altmetric
PlumX
Metrics
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.