Statistical identification of uniformly mutated segments within repeats

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

Volumn 2373, Issue , 2002, Pages 249-261

  Cenk Sahinalp S C ^a   Eichler, Evan ^b   Goldberg, Paul ^c   Berenbrink, Petra ^d   Friedetzky, Tom ^d   Ergun, Funda ^a  

^a CASE WESTERN RESERVE UNIVERSITY   (United States)

^b CASE WESTERN RESERVE UNIVERSITY SCHOOL OF MEDICINE   (United States)

^c UNIVERSITY OF WARWICK   (United Kingdom)

^d SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DNA; DYNAMIC PROGRAMMING; EVOLUTIONARY ALGORITHMS; PATTERN MATCHING; PROBABILITY; TESTING;

A-POSTERIORI PROBABILITIES; CONSTANT SIZES; CRITICAL APPLICATIONS; EVOLUTIONARY RELATIONSHIPS; GENOME SEQUENCES; GENOMIC SEQUENCE; RANDOM SOURCES; SELECTIVE PRESSURE;

DNA SEQUENCES;

EID: 84937459101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45452-7_21     Document Type: Conference Paper

References (26)

1. E. F. Adebiyi, T. Jiang, M. Kaufmann, An Efficient Algorithm for Finding Short Approximate Non-Tandem Repeats, In Proceedings of ISMB 2001.
2. A. N. Arslan, O. Egecioglu, P. A. Pevzner A new approachto sequence comparison: normalized sequence alignment, Proceedings of RECOMB 2001.
3. Bailey J. A., Yavor A. M., Massa H. F., Trask B. J., Eichler E. E., Segmental duplications: organization and impact within the current human genome project assembly, Genome Research 11(6), Jun 2001.
4. T. Bailey, C. Elkan. Fitting a mixture model by expectation maximization to discover motifs in biopolymers, Proceedings of I SMB 1994, AAAI Press.
5. J. Buhler and M. Tompa Finding Motifs Using Random Projections, In Proc. of RECOMB 2001.
6. J. Buhler Efficient Large Scale Sequence Comparison by Locality Sensitive Hashing, Bioinformatics 17(5), 2001.
7. Richard Cole and Ramesh Hariharan, Approximate String Matching: A Simpler Faster Algorithm, Proc. ACM-SIAM Sym po siu m on Discrete Algorithms, pp. 463-472, 25-27 January 1998.
8. Churchill, G. A. Stochastic models for heterogeneous DNA sequences, Bulletin of Mathemathical Biology 51, 79-94 (1989).
9. W. Chang and E. Lawler, Approximate String Matching in Sublinear Expected Time, Proc. IEEE Symposium on Foundations of Computer Science, 1990.
10. Fu, Y.-X and R. N. Curnow. Maximum likelihood estimation of multiple change points, Biometrika 77, 563-573 (1990).
11. Green, P. J. Reversible Jump Markov chain Monte Carlo Computation and Bayesian Model Determination Biometrika 82, 711-732 (1995)
12. A. L. Halpern Minimally Selected p and Other Tests for a Single Abrupt Change-point in a Binary Sequence Biometrics 55, Dec 1999.
13. A. L. Halpern Multiple Changepoint Testing for an Alternating Segments Model of a Binary Sequence Biometrics 56, Sep 2000.
14. J. E. Horvath, L. Viggiano, B. J. Loftus, M. D. Adams, N. Archidiacono, M. Rocchi, E. E. Eichler Molecular structure and evolution of an alpha satellite/non-satellite junction at 16p11. Human Molecular Genetics, 2000, Vol 9, No 1.
15. Jackson, Strachan, Dover, Human Genome Evolution, Bios Scientific Publishers, 1996.
16. E. S. Lander et al., Initial sequencing and analysis of the human genome, Nature, 15:409, Feb 2001.
17. V. I. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals, Cybernetics and Control Theory, 10(8):707-710, 1966.
18. T. Mashkova, N. Oparina, I. Alexandrov, O. Zinovieva, A. Marusina, Y. Yurov, M. Lacroix, L. Kisselev, Unequal crossover is involved in human alpha satellite DNA rearrangements on a border of the satellite domain, FEBS Letters, 441 (1998).
19. A. Marzal and E. Vidal, Computation of normalized edit distances and applications, IEEE Trans. on PAMI, 15(9):926-932, 1993.
20. L. Parida, I. Rigoutsos, A. Floratsas, D. Platt, Y. Gao, Pattern discovery on character sets and real valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm, Proceedings of ACM-SIAM SODA, 2000.
21. S. C. Sahinalp and U. Vishkin, Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm, Proc. IEEE Symposium on Foundations of Computer Science, 1996.
22. George P. SmithEvolution of Repeated DNA Sequences by Unequal Crossover, Science, vol 191, pp 528–535.
23. J. D. Thompson, D. G. Higgins, T. J. Gibson, Clustal-W: improving th e sensitivity of progressive multiple sequence alignment through sequence weighting, position specific gap penalties and weight matrix choice, Nucleic Acid Research 1994, Vol. 22, No. 22.
24. E. Ukkonen, On Approximate String Matching, Proc. Conference on Foundations of Computation Theory, 1983. 259
25. Venter, J. and Steel, S. Finding multiple abrupt change points. Computational Statistics and Data Analysis 22, 481-501. (1996).
26. C. Venter, The sequence of the human genome, Science, 16:291, Feb 2001.