Computational techniques for motif search

Frontiers in Bioscience

Volumn 14, Issue 13, 2009, Pages 5052-5065

  Rajasekaran, Sanguthevar ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

Approximation algorithms; Computational techniques; Exact algorithms; Motif search; Patterns identification; Review

Indexed keywords

ALGORITHM; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; BIOLOGY; CLUSTER ANALYSIS; COMPARATIVE STUDY; INTERNET; METHODOLOGY; PROTEIN ANALYSIS; PROTEIN DOMAIN; REVIEW; STATISTICAL ANALYSIS; STATISTICS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CLUSTER ANALYSIS; COMPUTATIONAL BIOLOGY; DATA INTERPRETATION, STATISTICAL; INTERNET; PATTERN RECOGNITION, AUTOMATED; PROTEIN INTERACTION DOMAINS AND MOTIFS; PROTEIN INTERACTION MAPPING;

EID: 69149089588     PISSN: 27686701     EISSN: 27686698     Source Type: Journal    
DOI: 10.2741/3586     Document Type: Article

References (66)

1. Falquet, L, M. Pagni, P. Bucher, N. Hulo, C. J. Sigrist, K. Hofmann, A. Bairoch: The PROSITE database, its status in 2002. Nucleic Acids Res 30, 235-238(2002) (Pubitemid 34679552)
2. Letunic, I, L. Goodstadt, N. J. Dickens, T. Doerks, J. Schultz, R. Mott, F. Ciccarelli, R. R. Copley, C. P. Ponting, P. Bork: Recent improvements to the SMART domainbased sequence annotation resource. Nucleic Acids Res 30, 242-244(2002) (Pubitemid 34679554)
3. Hodgman, T. C: The elucidation of protein function by sequence motif analysis, CABIOS Rev 5(1), 1013(1989).
4. Josephson, K, N. J. Logsdon, M. R. Walter: Crystal structure of the IL-10/IL-10R1 complex reveals a shared receptor binding site. Immunity 15, 35-46(2001) (Pubitemid 32728318)
5. Sidhu, S. S, W. J. Fairbrother, K. Deshayes: Exploring protein-protein interactions with phage display. Chembiochem 4, 14-25(2003) (Pubitemid 36114206)
6. Clemmons, D. R: Use of mutagenesis to probe IGF-binding protein structure/function relationships. Endocrine Reviews 22, 800-817(2001) (Pubitemid 34214296)
7. Edwards, R. J, N. Moran, M. Devocelle, A. Kiernan, G. Meade, W. Signac, M. Foy, S. D. E. Park, E. Dunne, D. Kenny, D. C. Shields: Bioinformatic discovery of novel bioactive peptides. Nature Chemical Biology 3(2), 108-112(2007) (Pubitemid 46134997)
8. Austin, R. S, N. J. Provart, S. R. Cutler: C-terminal motif prediction in eukaryotic proteomes using comparative genomics and statistical overrepresentation across protein families. BMC Genomics, 8:191(2007)
9. Deng, M, S. Mehta, F. Sun, T. Chen: Inferring domain-domain interactions from protein-protein interactions. Genome Res 12, 1540-1548(2002) (Pubitemid 35175092)
10. Reiss, D. J, B. Schwikowski: Predicting proteinpeptide interactions via a network-based motif sampler. Bioinformatics 20 Supplement 1, I274-I282 (2004) (Pubitemid 41296699)
11. Bailey, T. L, C. Elkan: Fitting a mixture model by expectation maximization to discover motifs in biopolymers. Proc. Second International Conference on Intelligent Systems for Molecular Biology, 28-36 (1994)
12. Puntervoll, P, R. Linding, C. Gemund, S. Chabanis-Davidson, M. Mattingsdal, S. Cameron, D. M. Martin, G. Ausiello, B. Brannetti, A. Costantini, F. Ferre, V. Maselli, A. Via, G. Cesareni, F. Diella, G. Superti-Furga, L. Wyrwicz, C. Ramu, C. McGuigan, R. Gudavalli, I. Letunic, P. Bork, L. Rychiewski, B. Kuster, M. Helmer-Citterich, W. N. Hunter, R. Aasland, T. J. Gibson: ELM server: a new resource for investigating short functional sites in modular eukaryotic proteins. Nucleic Acids Res 31(13), 3625-3630(2003) (Pubitemid 37448491)
13. Yaffe, M. B, G. G. Laparc, J. Lai, T. Obata, S. Volinia, L. C. Cantley: A motif-based profile scanning approach for genome-wide prediction of signaling pathways. Nat Biotechnol 19, 348-353(2001) (Pubitemid 32275344)
14. Hulo, N, A. Bairoch, V. Bulliard, L. Cerutti, B. A. Cuche, E. de Castro, C. Lachaize, P. S. Langendijk-Genevaux, J. A. Sigrist: The 20 years of PROSITE. Nucleic Acids Res, 1-5(2007)
15. Balla, S, V. Thapar, S. Verma, T. B. Luong, T. Faghri, C.-H. Huang, S. Rajasekaran, J. J. del Campo, J. H. Shinn, W. A. Mohler, M. W. Maciejewski, M. W. Gryk, B. Piccirillo, S. R. Schiller, M. Schiller: Minimotif miner: a tool for investigating protein function. Nature Methods 3(3), 175-177(2006)
16. Neduva, V, R. Linding, I. Su-Angrand, A. Stark, F. de Masi, T. J. Gibson, J. Lewis, L. Serrano, R. B. Russell: Systematic discoervy of new recognition peptides mediating protein interaction networks. PLoS Biology 3(12), 2090-2099(2005)
17. Bennett, S. P, C. G. Nevill-Manning, D. L. Brutlag: 3MOTIF: visualizing conserved protein sequence motifs in the protein structure database. Bioinformatics 19(4), 541-542(2003) (Pubitemid 36336521)
18. Li, H, J. Li: Discovery of stable and significant binding motif pairs from PDB complexes and protein interaction datasets. Bioinformatics 21(3), 314-324(2005) (Pubitemid 40246602)
19. Tan, S. H, W. Hugo, W. K. Sung, S. K. Ng: A correlated motif approach for finding short linear motifs from protein interaction networks. BMC Bioinformatics 7, 502(2006)
20. Brazma, A, I. Jonassen, I. Eidhammer, D. Gilbert: Approaches to the automatic discovery of patterns in biosequences. Report Number 113, Department of Informatics, University of Bergen, Bergen, Norway, December (1995)
21. Jonassen, I, J. F. Collins, D. G. Higgins: Finding flexible patterns in unaligned protein sequences. Protein Science 4(8), 1587-1595(1995)
22. Jonassen, I: Efficient discovery of conserved patterns using a pattern graph. Comput Appl Biosci 13, 509-522(1997) (Pubitemid 27480211)
23. Jonassen, I, I. Eidhammer: Discovering patterns conserved in sets of related protein sequences. Proc. of Norwegian Informatics Conference, Tapir, Norway, 95-112 (1995)
24. Smith, R. F, T. F. Smith: Automatic generation of primary sequence patterns from sets of related protein sequences. Proc. National Academy of Science, USA, January, 118-122 (1990)
25. Zhong, W, G. Altun, R. Harrison, P. C. Tai, Y. Pan: Improved k-means clustering algorithm for exploring local protein sequence motifs representing common structural property. IEEE Transactions on Nanobioscience 4(3), 255-265(2005) (Pubitemid 41441416)
26. Han, K. F, D. Baker: Global properties of the mapping between local amino acid sequence and local structure in proteins. Proc Natl Acad Sci USA 93, 5814-8(1996) (Pubitemid 26190760)
27. Roytberg, M. A: A search for common patterns in many sequences. CABIOS 8(1), 57-64(1992)
28. Schuler, G. D, S. F. Altschul, D. J. Lipman: A workbench for multiple alignment construction and analysis. PROTEINS: Structure, Function, and Genetics 9, 180-190(1991)
29. Vingron, M, P. Argos: Motif recognition and alignment for many sequences by comparison of dot-matrices. J Mol Biol 218, 33-43(1991) (Pubitemid 121003326)
30. Brazma, A, I. Jonassen, I. Eidhammer, E. Ukkonen: Relation patterns and their automatic discovery in biosequences. Report Number 135, Department of Informatics, University of Bergen, Bergen, Norway, June (1997)
31. Jonassen, I, I. Eidhammer, W. R. Taylor: Discovery of local packing motifs in protein structures. PROTEINS: Structure, Function, and Genetics 34, 206-219(1999) (Pubitemid 29028806)
32. Jonassen, I, I. Eidhammer, D. Conklin, W. R. Taylor: Structure motif discovery and mining the PDB. Proc. German Conference on Bioinformatics (2000)
33. Rajasekaran, S: Algorithms for motif search. In: Handbook of Computational Molecular Biology. Eds: Aluru, S, Chapman & Hall/CRC Press, 37-1-37-21 (2006)
34. Rajasekaran, S, S. Balla, C.-H. Huang, V. Thapar, M. Gryk, M. Maciejewski, M. Schiller: High performance exact algorithms for motif search. Journal of Clinical Monitoring and Computing, 19(4-5), 319-328(2005) (Pubitemid 43055305)
35. Rigoutsos, I, and A. Floratos: Motif discovery without alignment or enumeration. Proc. RECOMB, 221-227 (1998)
36. Arents, G, K. Moudrianakis: Topography of the histone octamer surface: repeating structural motifs utilized in the docking of nucleosomal DNA. Proc Natl Acad Sci USA 90, 10489-10493(1993) (Pubitemid 23347067)
37. Rigoutsos, I, A. Floratos: Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm. Bioinformatics 14(1), 55-67(1998) (Pubitemid 28397726)
38. Davey, N. E, D. C. Shields, R. J. Edwards: SLiMDisc: short linear motif discovery, correcting for common evolutionary descent. Nucleic Acids Res 34(12), 3546-3554(2006)
39. Horowitz, E, S. Sahni, S. Rajasekaran: Computer Algorithms, Silicon Press, 2008.
40. Ye, K, W. A. Kosters, P. I Jzerman: An efficient, versatile and scalable pattern growth approach to mine frequent patterns in unaligned protein sequences. Bioinformatics 23(6), 687-693(2007) (Pubitemid 46554719)
41. Agrawal, R, R. Srikant: Fast algorithms for mining association rules. Proc. 20th International Conference on Very Large Data Bases (VLDB), 487-499 (1994)
42. Keich, U, P. Pevzner: Finding motifs in the twilight zone. Bioinformatics 18, 1374-1381(2002) (Pubitemid 35244195)
43. Buhler, J, M. Tompa: Finding motifs using random projections. Proc. Fifth Annual International Conference on Computational Molecular Biology (RECOMB), April (2001)
44. Rajasekaran, S, S. Balla, C.-H. Huang: Exact algorithms for planted motif challenge problems. Journal of Computational Biology 12(8), 1117-1128(2005) (Pubitemid 41580026)
45. Eskin, E, P. Pevzner: Finding composite regulatory patterns in DNA sequences. Bioinformatics S 1, 354-363(2002)
46. Price, A, S. Ramabhadran, P. Pevzner: Finding subtle motifs by branching from sample strings. Bioinformatics 1(1), 1-7(2003)
47. Hertz, G, G. Stormo: Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics 15, 563-577(1999) (Pubitemid 29462105)
48. Lawrence, C. E, A. A. Reilly: An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins: Structure, Function, and Genetics 7, 41-51(1990) (Pubitemid 20102601)
49. Martinez, H. M: An efficient method for finding repeats in molecular sequences. Nucleic Acids Res 11(13), 4629-4634(1983)
50. Brazma, A, I. Jonassen, J. Vilo, E. Ukkonen: Predicting gene regulatory elements in silico on a genomic scale. Genome Res 15, 1202-1215(1998) (Pubitemid 29027223)
51. Galas, D. J, M. Eggert, M. S. Waterman: Rigorous patternrecognition methods for DNA sequences: Analysis of promoter sequences from Escherichia coli. J Mol Biol 186(1), 117-128(1985) (Pubitemid 16226569)
52. Sinha, S, M. Tompa: A statistical method for finding transcription factor binding sites. Proc. Eighth International Conference on Intelligent Systems for Molecular Biology, 344-354 (2000)
53. Staden, R: Methods for discovering novel motifs in nucleic acid sequences. Computer Applications in the Biosciences 5(4), 293-298(1989) (Pubitemid 19274602)
54. Tompa, M, An exact method for finding short motifs in sequences, with application to the ribosome binding site problem. Proc. Seventh International Conference on Intelligent Systems for Molecular Biology, 262-271 (1999)
55. van Helden, J, B. André, B., J. Collado-Vides: Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. J Mol Biol 281(5), 827-842(1998) (Pubitemid 28408432)
56. Davila, J, S. Rajasekaran: Extending pattern branching to handle challenging instances. Proc. 6th International Symposium on Bioinformatics and Bioengineering (BIBE), 65-69 (2006) (Pubitemid 47159400)
57. Davila, J, S. Balla, S. Rajasekaran: Space and time efficient algorithms for planted motif search. Proc. International Workshop on Bioinformatics Research and Applications (IWBRA), Reading, UK, May (2006)
58. Pevzner, P, S.-H. Sze: Combinatorial approaches to finding subtle signals in DNA sequences. Proc. Eighth International Conference on Intelligent Systems for Molecular Biology, 269-278 (2000)
59. Davila, J, S. Balla, S. Rajasekaran: Fast and practical algorithms for planted (l, d) motif search. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 544-555 (2007)
60. Chin, F. Y. L, H. C. M. Leung: Voting algorithms for discovering long motifs. Proceedings of the Third Asia-Pacific Bioinformatics Conference (APBC), 261-271 (2005)
61. Rocke, E, M. Tompa: An algorithm for finding novel gapped motifs in DNA sequences. Proc. Second International Conference on Computational Molecular Biology (RECOMB), 228-233 (1998)
62. Sagot, M. F, Spelling approximate repeated or common motifs using a suffix tree. Springer-Verlag LNCS 1380, 111-127(1998)
63. Adebiyi, E. F, M. Kaufmann: Extracting common motifs under the Levenshtein measure: theory and experimentation. Proc. Workshop on Algorithms for Bioinformatics (WABI), Springer-Verlag LNCS 2452, 140-156(2002)
64. Wijaya, E, K. Rajaraman, S.-M. Yiu, W.-K. Sung: Detection of generic spaced motifs using submotif pattern mining. Bioinformatics 23(12), 1476-1485(2007) (Pubitemid 47244472)
65. Favorov, A. V, M. S. Gelfand, A. V. Gerasimova, D. A. Ravcheev, A. A. Mironov, V. J. Makeev: A Gibbs sampler for identification of symmetrically structured, spaced DNA motifs with improved estimation of the signal length. Bioinformatics 21(10), 2240-2245(2005) (Pubitemid 40731575)
66. Carvalho, A. M, A. T. Freitas, A. L. Oliveira, M-F. Sagot: A highly scalable algorithm for the extraction of cisregulatory regions. Proc. Asia-Pacific Bioinformatics Conference (APBC), 273-282 (2005)