Assessing the statistical significance of overrepresented oligonucleotides

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

Volumn 2149, Issue , 2001, Pages 85-97

  Denise, Alain ^a   Régnier, Mireille ^b   Vandenbogaert, Mathias ^b,c  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b INRIA   (France)

^c UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; OLIGOMERS; OLIGONUCLEOTIDES; PARALLEL PROCESSING SYSTEMS;

BIOLOGICAL DATA; COMPLEXITY ISSUES; COMPUTATIONAL BIOLOGY; EFFICIENT COMPUTATION; LARGE DEVIATIONS; P-VALUES; STATISTICAL SIGNIFICANCE;

COMPUTATIONAL COMPLEXITY;

EID: 84959049129     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44696-6_7     Document Type: Conference Paper

References (27)

1. E. Beaudoing, S. Freier, J. Wyatt, J.M. Claverie, and D. Gautheret. Patterns of Variant Polyadenylation Signal Usage in Human Genes. Genome Research., 10:1001–1010, 2000.
2. J. Buhler and M. Tompa. Finding Motifs Using Random Projections. In RECOMB’01, pages 69–76. ACM-,2001. Proc.RECOMB’01, Montréal.
3. A. Denise and M. Regnier. Word statistics conditioned by overrepresented words, 2001. in preparation; http://algo.inria.fr/regnier/index.html.
4. M.S. Gelfand and E.V. Koonin. Avoidance of palindromic words in bacterial and archaeal genomes: a close connection with restriction enzymess. Nucleic Acids Research, 25(12):2430–2439, 1997.
5. M. Geske, A. Godbole, A. Schafner, A. Skolnick, and G. Wallstrom. Compound Poisson Approximations for Word Patterns Under Markovian Hypotheses. J. Appl. Prob., 32:877–892, 1995.
6. R. Karlin and S.F. Altschul. Applications and statistics for multiple high-scoring segments in molecular sequences. Proc. Natl. Acad. Sci. U.S.A., 90:5873–5877, 1993
7. Maude Klaerr-Blanchard, Helene Chiapello, and Eivind Coward. Detecting localized repeats in genomic sequences: A new strategy and its application to B. subtilis and A. thaliana sequences. Comput. Chem., 24(1):57–70, 2000.
8. J. Kleffe and M. Borodovsky. First and second moment counts of words in random texts generated by Markov chains. Comput. Appl. Biosci., 8, 433-441, 1992.
9. X. Liu, D.L. Brutlag, and J. Liu. Bioprospector: Discovering conserved dna motifs in upstream regulatory regions of co-expressed gene. In 6-th Pacific Symposium on Biocomputing, pages 127–138, 2001.
10. L. Marsan and M.F. Sagot. Extracting structured motifs using a suffix tree-algorithms and application to promoter consensus identification. In RECOMB’00, pages 210–219. ACM-, 2000. Proceedings RECOMB’00, Tokyo.
11. P. Nicodeme. The symbolic package Regexpcount. In GCB’00, 2000. presented at GCB’00, Heidelberg, October 2000; available at http://algo.inria.fr/libraries/software.html.
12. G. Nuel. Grandes deviations et chaines de Markov pour l’etude des mots exceptionnels dans les sequences biologiques. Phd thesis, Universite Rene Descartes, Paris V, 2001. to be defended in July,2001.
13. P.A. Pevzner, M. Borodovski, and A. Mironov. Linguistic of Nucleotide sequences:The Significance of Deviations from the Mean: Statistical Characteristics and Prediction of the Frequency of Occurrences of Words. J. Biomol. Struct. Dynam., 6:1013–1026, 1991.
14. E.M. Panina, A.A. Mironov, and M.S. Gelfand. Statistical analysis of Complete Bacterial Genomes:Avoidance of Palindromes and Restriction-Modification Systems. Genomics. Proteomics. Bioinformatics, 34(2):215–221, 2000.
15. F.R. Roth, J.D. Hughes, P.E. Estep, and G.M. Church. Finding DNA regulatory motifs within unaligned noncoding sequences clustered by whole-genome mRNA quantitation. Nature Biotechnol., 16:939–945, 1998.
16. M. Regnier, A. Lifanov, and V. Makeev. Three variations on word counting. In GCB’00, pages 75–82. Logos-Verlag, 2000. Proc. German Conference on Bioinformatics, Heidelberg; submitted to BioInformatics.
17. M. Regnier and W. Szpankowski. On Pattern Frequency Occurrences in a Markovian Sequence. Algorithmica, 22(4):631–649, 1998. preliminary draft at ISIT’97.
18. G. Reinert and S. Schbath. Compound Poisson Approximation for Occurrences of Multiple Words in Markov Chains. Journal of Computational Biology, 5(2):223–253
19. G. Reinert, S. Schbath, and M. Waterman. Probabilistic and Statistical Properties of Words: An Overview. Journal of Computational Biology, 7(1):1–46, 2000.
20. S. Robin and J. J. Daudin. Exact distribution of word occurrences in a random sequence of letters. J. Appl. Prob., 36(1):179–193, 1999.
21. E. Rocha, A. Viari, and A. Danchin. Oligonucleotides bias in bacillus subtilis: general trands and taxonomic comparisons. Nucl. Acids Research, 26:2971–2980, 1998.
22. A.T. Vasconcelos, M.A. Grivet-Mattoso-Maia, and D.F. de Almeida. Short interrupted palindromes on the extragenic DNA of Escherichia coli K-12, Haemophilus influenzae and Neisseria meningitidis. BioInformatics, 16(11):968–977, 2000.
23. J. van Helden, B. Andre, and J. Collado-Vides. Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. J. Mol. Biol., 281:827–842, 1998.
24. Martin Tompa. An exact method for finding short motifs in sequences, with application to the ribosome binding site problem. In ISMB’99, pages 262–271. AAAI Press, 1999. Seventh International Conference on Intelligent Systems for Molecular Biology, Heidelberg,Germany.
25. A. Vanet, L. Marsan, and M.-F. Sagot. Promoter sequences and algorithmical methods for identifying them. Res. Microbiol., 150:779–799, 1999.
26. M.S. Waterman, R. Arratia, and D.J. Galas. Pattern recognition in several sequences: consensus and alignment. Bull. Math. Biol., 45, 515-527, 1984.
27. M. Waterman. Introduction to Computational Biology. Chapman and Hall, London, 1995.