A generic motif discovery algorithm for sequential data

Bioinformatics

Volumn 22, Issue 1, 2006, Pages 21-28

  Jensen, Kyle L ^a   Styczynski, Mark P ^a   Rigoutsos, Isidore ^a,b   Stephanopoulos, Gregory N ^a  

^a Massachusetts Institute of Technology Cambridge   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; AMINO ACID SEQUENCE; ARTICLE; BIOINFORMATICS; CLUSTER ANALYSIS; CONTROLLED STUDY; DNA SEQUENCE; INFORMATION PROCESSING; NOMENCLATURE; PRIORITY JOURNAL; PROTEIN EXPRESSION; PROTEIN MOTIF; PROTEIN STRUCTURE; SEQUENCE ANALYSIS; SEQUENCE HOMOLOGY; STRUCTURE ANALYSIS;

EID: 30344460682     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/bti745     Document Type: Article

References (49)

1. Alexandrov,N.N. (1996) SARFing the PDB. Protein Eng., 9, 727-732.
2. Alexandrov,N.N. and Fischer,D (1996) Analysis of topological and nontopological structural similarities in the PDB: New examples with old structures. Proteins, 25, 354-365.
3. Altschul,S.F. et al. (1997) Gapped BLAST and PSI-BLAST: A new generation of protein database search programs. Nucleic Acids Res., 25, 3389-3402.
4. Aravind,L and Koonin,E.V. (1998) The HD domain defines a new superfamily of metal-dependent phosphohydrolases. Trends Biochem Sci., 23, 469-472.
5. Arun,K. S. et al. (1987) Least-squares fitting of two 3-d point sets. IEEE Trans. Pattern Anal. Mach. Intell., 9, 698-700.
6. Bailey,T.L. and Elkan,C. (1994) Fitting a mixture model by expectation maximization to discover motifs in biopolymers. Proc. Int. Conf. Intell. Syst. Mol. Biol., 2, 28-36.
7. Bairoch,A (2000) The ENZYME database in 2000. Nucleic Acids Res., 28, 304-305.
8. Bairoch,A. and Apweiler,R. (2000) The Swiss-Prot protein sequence database and its supplement TrEMBL in 2000. Nucleic Acids Res., 28, 45-48.
9. Bateman,A et al. (2004) The Pfam protein families database. Nucleic Acids Res., 32 (Database issue), D138-D141.
10. Buhler,J. and Tompa,M. (2001) Finding motifs using random projections. In Proceedings of the Fifth Annual International Conference on Computational Biology. Quebec, Canada, ACM Press, New York, pp. 69-76.
11. Crooks,G.E. et al. (2004) WebLogo: A sequence logo generator. Genome Res., 14, 1188-1190.
12. Dietmann,S and Holm,L. (2001) Identification of homology in protein structure classification. Nat. Struct. Biol., 8, 953-957.
13. Eddy,S.R. (1998) Profile hidden Markov models. Bioinformatics, 14, 755-763.
14. Eidhammer,I. et al. (2000) Structure comparison and structure patterns. J. Comput. Biol., 7, 685-716.
15. Eskin,E. and Pevzner,P.A. (2002) Finding composite regulatory patterns in DNA sequences. Bioinformatics, 18 ((Suppl. 1)), 354-363.
16. Garey,M. and Johnson,D. (1979) Computers and Intractability: A Guide to the Theory of NP - Completeness. W.H. Freeman and Company, NY.
17. Henikoff,s. and Henikoff,J. G. (1992) Amino acid substitution matrices from protein blocks. Proc. Natl Acad. Sci. USA, 89, 10915-10919.
18. Henikoff,S. et al. (1995) Automated construction and graphical presentation of protein blocks from unaligned sequences. Gene, 163, GC17-GC26.
19. Hertz,G.Z. and Stormo,G.D. (1999) Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics,15, 563-577.
20. Hofmann,K. et al. (1999) The PROSITE database, its status in 1999. Nucleic Acids Res., 27, 215-219.
21. Holm,L. and Sander,C. (1993) Protein structure comparison by alignment of distance matrices. J. Mol. Biol., 233, 123-138.
22. Holm,L and Sander,C (1997) Enzyme HIT. Trends Biochem Sci., 22, 116-117.
23. Holm,L. et al. (1992) A database of protein structure families with common folding motifs. Protein Sci., 1, 1691-1698.
24. Horn,B.K.P. (1987) Closed-form solution of absolute orientation using unit quaternions. J. Optical Soc. America A, 4, 629-642.
25. Hunter,C.G. and Subramaniam,S. (2003) Protein fragment clustering and canonical local shapes. Proteins, 50, 580-588.
26. Jonassen,I et al. (1995) Finding flexible patterns in unaligned protein sequences. Protein Sci, 4, 1587-1595.
27. Jonassen,I. et al. (2002) Structure motif discovery and mining the PDB: Bioinformatics, 18, 362-367.
28. Keich,U. and Pevzner,P.A. (2002) Finding motifs in the twilight zone. Bioinformatics, 18, 1374-1381.
29. Kolodny,R. et al. (2005) Comprehensive evaluation of protein structure alignment methods: Scoring by geometric measures. J. Mol. Biol., 346, 1173-88.
30. Lawrence,C.E. et al. (1993) Detecting subtle sequence signals: A Gibbs sampling strategy for multiple alignment. Science, 262, 208-214.
31. Lima,C.C. et al. (1997) MAD analysis of FHIT, a putative human tumor suppressor from the HIT protein family. Structure, 5, 763-774.
32. Madej,T et al. (1995) Threading a database of protein cores. Proteins, 23, 356-369.
33. Mancheron,A and Rusu,I. (2003) Pattern discovery allowing wild-cards, substitution matrices, and multiple score functions. In Algorithms in Bioinformatics, Proceedings of the Lecture Notes in Bioinformatics. Algorithms in Bioinformatics: Third International Workshop, WABI 2003, Budapest, Hungary, Springer-Verlag, Berlin, pp. 124-138.
34. Marchler-Bauer,A. et al. (2003) CDD: A curated Entrez database of conserved domain alignments. Nucleic Acids Res., 31, 383-387.
35. Murthy,V.L. and Rose,G.D. (2003) RNABase: An annotated database of RNA structures. Nucleic Acids Res., 31, 502-504.
36. Orengo,C.A. and Taylor,W.R. (1996) SSAP: Sequential structure alignment program for protein structure comparison. Methods Enzymol, 266, 617-635.
37. Ortiz,A.R. et al. (2002) MAMMOTH (matching molecular models obtained from theory): An automated method for model comparison. Protein Sci., 11, 2606-2621.
38. Pevzner,P.A. and Sze,S. (2000) Combinatorial Approaches to finding subtle signals in DNA sequences. In Proceedings of the International Conference on Intelligent Systems for Molecular Biology. AAAI Press, pp. 269-278.
39. Pevzner,P. and Sze,S.H. (2001) private communication.
40. Price,A et al. (2003) Finding subtle motifs by branching from sample strings. Bioinformatics, 19 (Suppl. 2), II149-II155.
41. Rigoutsos,I. et al. (1999) Dictionary building via unsupervised hierarchical motif discovery in the sequence space of natural proteins. Proteins, 37, 264-77.
42. Rigoutsos,I. and Floratos,A. (1998) Combinatorial pattern discovery in biological-sequences: The TEIRESIAS algorithm. Bioinformatics, 14, 55-67.
43. Salgado,H. et al. (2004) RegulonDB (version 4.0): Transcriptional regulation, operon organization and growth conditions in Escherichia coli K-12. Nucleic Acids Res., 32 (Database issue), D303-D306.
44. Styczynski,M. et al. (2004) An extension and novel solution to the motif challenge problem. Genome Informatics, 15, 63-71.
45. Tomita,E. et al. (1989) An Optimal Algorithm for finding all the cliques. SIG Algorithms, 12, 91-98.
46. Tompa,M. et al. (2005) Assessing computational tools for the discovery of transcription factor binding sites. Nat. Biotechnol., 23, 137-144.
47. Wedekind,J.E. et al. (1996) The structure of nucleotidylated histidine-166 of galactose-1-phosphate uridylyltransferase provides insight into phosphoryl group transfer. Biochemistry, 35, 11560-11569.
48. Zaki,M.J. and Ogihara,M. (1998) Theoretical foundations of association rules. In Proceedings of 3rd SIGMOD'98 Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD'98). Seattle, Washington, pp. 7:1-7:8.
49. Zaki,M.J. (2000) Scalable algorithms for association mining. Knowledge Data Eng., 12, 372-390.