Proteome analysis based on motif statistics

Bioinformatics

Volumn 18, Issue , 2002, Pages S161-S171

  Nicodeme P ^a   Doerks, T ^b   Vingron, M ^c  

^a CNRS   (France)

^b EUROPEAN MOLECULAR BIOLOGY LABORATORY   (Germany)

^c MAX PLANCK INSTITUTE FOR MOLECULAR GENETICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PROTEOME;

COMPUTER PROGRAM; CONFERENCE PAPER; DATA BASE; INTERNET; MATHEMATICAL ANALYSIS; PRIORITY JOURNAL; PROTEIN ANALYSIS; PROTEIN MOTIF; STATISTICAL ANALYSIS;

EID: 0344376513     PISSN: 13674803     EISSN: None     Source Type: Journal    
DOI: 10.1093/bioinformatics/18.suppl_2.S161     Document Type: Article

References (19)

1. Bateman,A., Birney,E., Cerruti,L., Durbin,R., Etwiller,L., Eddy,S.R., Griffiths-Jones,S., Howe,K.L., Marshall,M. and Sonnhammer,E.L.L. (2002) The Pfam protein families database. Nucleic Acids Res., 30, 276-280.
2. Guibas,L.J. and Odlyzko,A.M. (1981) String overlaps, pattern matching, and nontransitive games. J. Combin. Theor. Series A, 30, 183-208.
3. Hofmann,K., Bucher,P., Falquet,L. and Bairoch,A. (1999) The PROSITE database, its status in 1999. Nucleic Acids Res., 27, 215-219.
4. Jensen,L.J. and Knudsen,S. (2000) Automatic discovery of regulatory patterns in promoters regions based on whole cell expression data and functional annotation. Bioinformatics, 16, 326-333.
5. Kelley,D. (1995) Automata and Formal Languages. An introduction. Prentice-Hall, Englewood Cliffs, NJ.
6. Kozen,D.C. (1997) Automata and Computability. Springer, New York.
7. Nicodème,P. (2000) Regexpcount, a symbolic package for counting problems on regular expressions and words. In German Conference on Bioinformatics GCB October 5-7, 2000. Heidelberg, pp. 63-73.
8. Nicodème,P. (2001) Fast approximate motif statistics. J. Comput. Biol., 8, 235-248.
9. Nicodème,P., Salvy,B. and Flajolet,P. Motif statistics. Theoretical Computer Science, Extended version of an article published in the proceedings of 7th Annual European Symposium on Algorithms ESA'99, Prague.
10. Pevzner,P.A., Borodovski,M.Y. and Mironov,A.A. (1989) Linguistic of nucleotide sequences: the significance of deviation from mean statistical characteristics and prediction of the frequencies of occurrence of words. J. Biomol. Struct. Dyn., 6, 1013-1026.
11. Prum,B., Rodolphe,F. and de Turckheim,E. (1995) Finding words with unexpected frequencies in deoxyribonucleic acid sequences. J. R. Statist. Soc. B, 57, 205-220.
12. Regnier,M. (1998) A unified approach to words statistics. In Second Annual International Conference on Computational Molecular Biology. ACM Press, New York, pp. 207-213.
13. Regnier,M. (2000) A unified approach to word occurrences probabilities. Discrete Applied Mathematics, 104, 259-280. Special issue on Computational Biology.
14. Regnier,M. and Szpankowski,W. (1998) On Pattern Frequency Occurrences in a Markovian Sequence. Algorithmica, 22, 631-649.
15. Reinert,G. and Schbath,S. (1998) Compound Poisson Approximations for Occurrences of Multiple Words in Markov Chains. J. Comp. Biol., 5, 223-253.
16. Ruoslahti,E. and Pierschbacher,M. (1986) Arg-Gly-Asp: a versatile cell recognition signal. Cell, 44, 517-518.
17. Schbath,S., Prum,B. and de Turckheim,É. (1995) Exceptional motifs in different Markov chain models for a statistical analysis of DNA sequences. J. Comp. Biol., 2, 417-437.
18. Schultz,J., Copley,R., Doerks,T.C.P.P. and Bork,P. (2000) SMART: a web-based tool for the study of genetically mobile domains. Nucleic Acids Res., 28, 231-234.
19. Sinha,S. and Tompa,M. (2000) A Statistical Method for Finding Transcription Factor Binding Sites. In Eighth International Conference on Intelligent Systems for Molecular Biology. AAAI Press, pp. 354-354.