Calculating the Exact Probability of Language-Like Patterns in Biomolecular Sequences

@article{Atteson1998CalculatingTE,
  title={Calculating the Exact Probability of Language-Like Patterns in Biomolecular Sequences},
  author={Kevin Atteson},
  journal={Proceedings. International Conference on Intelligent Systems for Molecular Biology},
  year={1998},
  volume={6},
  pages={17-24}
}
We present algorithms for the exact computation of the probability that a random string of a certain length matches a given regular expression. These algorithms can be used to determine statistical significance in a variety of pattern searches such as motif searches and gene-finding. This work improves upon work of Kleffe and Langebacker (Kleffe & Langbecker 1990) and of Sewell and Durbin (Sewell & Durbin 1995) in several ways. First, in many cases of interest, the algorithms presented here are… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 12 extracted citations

Fast Approximate Motif Statistics

Journal of Computational Biology • 2001

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Polynomial and Matrix Computations

Progress in Theoretical Computer Science • 1994

Modelling by shortest data

1978

Modelling by shortest data description

R Durbin
Automatica • 1978

Similar Papers

Loading similar papers…