Occurrence Probability of Structured Motifs in Random Sequences
暂无分享,去创建一个
Jean-Jacques Daudin | Stéphane Robin | Marie-France Sagot | Sophie Schbath | Hugues Richard | J. Daudin | M. Sagot | S. Robin | Sophie Schbath | Hugues Richard
[1] J. D. Helmann,et al. Compilation and analysis of Bacillus subtilis sigma A-dependent promoter sequences: evidence for extended contact between RNA polymerase and upstream promoter DNA , 1995, Nucleic Acids Res..
[2] A A Deev,et al. Non-canonical sequence elements in the promoter structure. Cluster analysis of promoters recognized by Escherichia coli RNA polymerase. , 1997, Nucleic acids research.
[3] Marie-France Sagot,et al. Algorithms for Extracting Structured Motifs Using a Suffix Tree with an Application to Promoter and Regulatory Site Consensus Identification , 2000, J. Comput. Biol..
[4] G. Blom,et al. How many random digits are required until given sequences are obtained? , 1982, Journal of Applied Probability.
[5] Jean-Jacques Daudin,et al. Exact distribution of word occurrences in a random sequence of letters , 1999, Journal of Applied Probability.
[6] Wojciech Rytter,et al. Text Algorithms , 1994 .
[7] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .
[8] J. Collado-Vides,et al. Discovering regulatory elements in non-coding sequences by analysis of spaced dyads. , 2000, Nucleic acids research.
[9] Jean-Jacques Daudin,et al. Exact Distribution of the Distances between Any Occurrences of a Set of Words , 2001 .
[10] John Riedl,et al. Generalized suffix trees for biological sequence data: applications and implementation , 1994, 1994 Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences.
[11] F. Neidhart. Escherichia coli and Salmonella. , 1996 .
[12] Marie-France Sagot,et al. Extracting structured motifs using a suffix tree—algorithms and application to promoter consensus identification , 2000, RECOMB '00.