A frequent pattern mining method for finding planted (l, d)-motifs of unknown length

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6401 LNAI, Issue , 2010, Pages 240-248

  Jia, Caiyan ^a   Lu, Ruqian ^b,c   Chen, Lusheng ^b  

^a BEIJING JIAOTONG UNIVERSITY   (China)

^b FUDAN UNIVERSITY   (China)

^c INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

APRIORI; BINDING MOTIF; BREADTH-FIRST SEARCH; CLASSICAL ALGORITHMS; DOWNWARD CLOSURE PROPERTIES; EFFICIENT ALGORITHM; EMPIRICAL STUDIES; EXISTING METHOD; FREQUENT PATTERN MINING; MOLECULAR MECHANISM; SEARCH SPACES; TRANSCRIPTIONAL REGULATION;

ALGORITHMS; LAWS AND LEGISLATION; MINING; ROUGH SET THEORY;

PROBLEM SOLVING;

EID: 78349248601     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16248-0_37     Document Type: Conference Paper

References (20)

1. Tompa, M.: Assessing computational tools for the discovery of transcription factor binding sites. Nature Biotechnology 23, 137-144 (2005)
2. Hu, J., Li, B., Kihara, D.: Limitations and potentials of current motif discovery algorithms. Nucleic Acids Research 33(15), 4899-4913 (2005)
3. Das, M.K., Dai, H.K.: A survey of DNA motif finding algorithms. BMC Bioinformatics 8(suppl. 7) (2007)
4. Pevzner, P., Sze, S.: Combinatorial approaches to finding subtle signals in DNA sequences. In: Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, California, USA, pp. 269-278 (2000)
5. Sagot, M.F.: Spelling approximate repeated or common motifs using a suffix tree. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 111-127. Springer, Heidelberg (1998)
6. Eskin, E., Pevzner, P.: Finding composite regulatory patterns in DNA sequences. Bioinformatics, 354-363 (2002)
7. Buhler, J., Tompa, M.: Finding motifs using random projections. In: Proceeding of the Fifth Annual Internal Conference Computational Molecular Biology, Canada. ACM Press, New York (2001)
8. Keich, U., Pevzner, P.A.: Subtle motif: defining the limits of finding algorithms. Bioinformatics 18(10), 1382-1390 (2002)
9. Price, A., Ramabhadran, S., Pevzner, P.A.: Finding subtle motifs by branching from sample string. Bioinformatics 2, 1-7 (2003)
10. Evans, P.A., Smith, A.D.: Toward optimal motif enumeration. In: Proceedings of Algorithms and Data Structures, 8th International Workshop, pp. 47-58 (2003)
11. Pavesi, G., Mauri, G., Pesole, G.: An algorithm for finding signals of unknown length in DNA sequences. Bioinformatics 17, 207-214 (2001)
12. Davila, J., Balla, S., Rajasekaran, S.: Fast and practical algorithms for planted (l, d) motif search. IEEE/ACM Trans. on Computational Biology and Bioinformatics 4, 544-552 (2007)
13. Chin, Y.L., Leung, C.M.: Voting algorithms for discovering long motifs. In: Proceedings of the Third Asia-Pacific Bioinformatics Conference, Singapore, pp. 261-271 (2005)
14. Leung, C.M., Chin, Y.L.: An efficient algorithm for the extended (l, d)-motif problem with unknown number of binding sites. In: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering, pp. 11-18 (2005)
15. Pisanti, N., Carvalho, A.M., et al.: RISOTTO: fast extraction of motifs with mismatches. In: Proceeding of the Seventh Latin Am. Theoretical Informatics Symp., pp. 757-768 (2006)
16. Lawrence, C.E., Altschul, S.F., et al.: Detecting subtle sequence signals: A Gibbs sampling strategy for multiple alignment. Science 262, 208-214 (1993)
17. Lu, R.Q., Jia, C.Y., et al.: An exact data mining method for finding center strings and all their instances. IEEE Trans. on Knowledge and Data Engineering 19(4), 509-522 (2007)
18. Styczynski, M.P., Jensen, K.L.: An extension and novel solution to the (l, d)-motif challenge problem. Genome Informatics 15, 63-71 (2004)
19. Jensen, K.L., Styczynski, M.P.: et al: A generic motif discovery algorithm for sequential data. Bioinformatics 22, 21-28 (2006)
20. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, Santiago de Chile, Chile, pp. 487-499 (1994)