Poisson process approximation for repeats in one sequence and its application to sequencing by hybridization

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

Volumn 1075, Issue , 1996, Pages 209-219

  Arratia, Richard ^a   Reinert, Gesine ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONCRETES; ERROR ANALYSIS; ERRORS; PATTERN MATCHING; POISSON DISTRIBUTION; PROBABILITY DISTRIBUTIONS;

DE BRUIJN GRAPHS; ITS APPLICATIONS; PARTIAL RECOVERY; POISSON APPROXIMATIONS; POISSON PROCESS APPROXIMATION; SEQUENCING BY HYBRIDIZATION; TARGET SEQUENCES; UNIFORM DISTRIBUTION;

GENE ENCODING;

EID: 0347127084     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61258-0_16     Document Type: Conference Paper

References (15)

1. D. Aldous, Probability approximations via the Poisson clumping heuristic. Springer, New York.
2. R. Arratia, Sequencing by hybridization: set versus multiset. (1996) In preparation.
3. R. Arratia, L. Goldstein and L. Gordon, Two moments suffice for Poisson approx­imations: The Chen-Stein method. Ann. Probab. 17 (1989), 9-25.
4. R. Arratia, L. Goldstein and L. Gordon, Poisson Approximation and the Chen- Stein Method. Statistical Science 5 (1990), 403-434.
5. R. Arratia, D. Martin, G. Reinert, and M. S. Waterman, Poisson process approx­imation for sequence repeats, and sequencing by hybridization. (1996) Submitted to J. Comp. Biol., 68 pp.
6. R. Arratia and G. Reinert (1996) Partial recovery in sequencing by hybridization. In Preparation.
7. R. Arratia and S. Tavaré, Reviews of Probability approximations via the Poisson clumping heuristic by D. Aldous and Poisson approximation by A.D. Barbour, L. Holst, and S. Janson. Ann. Probab. 21 (1993), 2269-2279.
8. A.D. Barbour, L. Holst, S. Janson, Poisson approximation. Clarendon, Oxford 1992.
9. L.H.Y. Chen, Poisson approximation for dependent trials. Ann. Probab. 3 (1975), 534-545.
10. M. Dyer, A. Frieze and S. Suen, The Probability of Unique Solutions of Sequencing by Hybridization. J. Comp. Biol. 1 (1994), 105-110.
11. S. Karlin and F. Ost, Counts on long aligned word matches along random letter sequences. Adv. Appl. Prob. 19 (1987), 293-351.
12. P.A. Pevzner, DNA physical mapping and alternating Eulerian cycles in colored graphs. Algorithmica 13 (1995), 77-105.
13. E. Ukkonen, Approximate string-matching with q-grams and maximal matches. Theoretical Computer Science 92 (1992), 191-211.
14. M.S. Waterman, Introduction to Computational Biology: Maps, Sequences and Genomes. Chapman Hall 1995.
15. A.M. Zubkov and V.G. Mikhailov, Limit distributions of random variables asso­ciated with long duplications in a sequence of independent trials. Theory Prob. Applications 19 (1974), 172-179.