Identifying satellites and periodic repetitions in biological sequences

Journal of Computational Biology

Volumn 5, Issue 3, 1998, Pages 539-553

  Sagot, Marie France ^a,c   Myers, Eugene W ^b  

^a INSTITUT PASTEUR   (France)

^b University of Arizona   (United States)

^c Université de Marne la Vallée   (France)

Author keywords

Approximate match; Consensus model; Direct inverse repeats; DNA satellites; Tandem repeats

Indexed keywords

ALGORITHM; AMINO ACID SEQUENCE; BASE PAIRING; CONFERENCE PAPER; DNA SEQUENCE; FILTRATION; FUNGAL GENETICS; PARAMETER; PRIORITY JOURNAL; PROBABILITY; SACCHAROMYCES CEREVISIAE; SEQUENCE ANALYSIS; STATISTICAL MODEL; TANDEM REPEAT;

EID: 0031752310     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.1998.5.539     Document Type: Conference Paper

References (22)

1. Benson, G. 1998. An algorithm for finding tandem repeats of unspecified pattern size. In Waterman, M., Istrail, S., and Pevzner, P., eds. RECOMB 98, 20-29. ACM Press.
2. Benson, G., and Waterman, M. 1994. A method for fast database search for all k-nucleotide repeats. Nucleic Acids Research 22, 4828-4836.
3. Charlesworth, B., Sniegowski, P., and Stephan, W. 1994. The evolutionary dynamics of repetitive DNA in eukaryotes. Nature 371, 215-220.
4. Clift, B., Haussler, D., McConnell, R., Schneider, T.D., and Stormo, G.D. 1986. Sequence landscapes. Nucleic Acids Res. 14, 141-158.
5. Crochemore, M. 1981. An optimal algorithm for computing the repetitions in a word. Inf. Proc. Letters 12, 244-250.
6. Delgrange, O. 1997. Un algorithme rapide pour une compression modulaire optimale. Application à l'analyse de séquences génétiques. PhD thesis. Thèse de doctorat - Université de Lille I.
7. Fischetti, V., Landau, G., Schmidt, J., and Sellers, P. 1992. Identifying periodic occurrences of a template with applications to protein structure. In Galil, Z., Apostolico, A., Crochemore, M., and Manber, U., eds. Combinatorial Pattern Matching, volume 644 of Lecture Notes in Computer Science 111-120. Springer-Verlag.
8. Kannan, S.K., and Myers, E.W. 1993. An algorithm for locating non-overlapping regions of maximum alignment score. In Galil, Z., Apostolico, A., Crochemore, M., and Manber, U., eds. Combinatorial Pattern Matching, volume 684 of Lecture Notes in Computer Science 7486, Springer-Verlag.
9. Karlin, S., Morris, M., Ghandour, G., and Leung, M.-Y. 1988. Efficient algorithms for molecular sequence analysis. Proc. Natl. Acad, Sci, USA, 85, 841-845.
10. Karp, R.M., Miller, R.E., and Rosenberg, A.L. 1972. Rapid identification of repeated patterns in strings, trees and arrays. In Proc. 4th Annu. ACM Symp. Theory of Computing 125-136.
11. Landau, G., and Schmidt, J. 1993. An algorithm for approximate tandem repeats. In Galil, Z., Apostolico, A., Crochemore, M., and Manber, U., eds. Combinatorial Pattern Matching, volume 684 of Lecture Notes in Computer Science 120-133. Springer-Verlag.
12. Leung, M.-Y., Blaisdell, B.E., Burge, C., and Karlin, S. 1991. An efficient algorithm for identifying matches with errors in multiple long molecular sequences. J. Mol. Biol. 221, 1367-1378.
13. Milosavljevic, A., and Jurka, J. 1993. Discovering simple DNA sequences by the algorithmic significance method. Comput. Appl. Biosci. 9, 407-411.
14. Myers, E.W., and Miller, W., 1989. Approximate matching of regular expressions. Bull. Math. Biol. 51, 5-37.
15. Rivals, E., and Delgrange, O. 1995. A first step toward chromosome analysis by compression algorithms. In Bourbakis, N.G., ed. First International IEEE Symposium on Intelligence in Neural and Biological Systems 233-239, IEEE Computer Society Press.
16. Rivals, E., Delgrange, O., Delahaye, J.-P., Dauchet, M., Delorme, M.-O., Hénaut, A., and Ollivier, E. 1997. Detection of significant patterns by compression algorithms: The case of approximate tandem repeats in DNA sequences. Comput. Appl. Biosci. 13, 131-136.
17. Verin, R., and Crochemore, M. 1997. Direct construction of compact directed acyclic word graphs. In Apostolico, A., and Hein, J., eds. Combinatorial Pattern Matching, volume 1264 of Lecture Notes in Computer Science 116-129, Springer-Verlag, 1997.
18. Sagot, M.-F., Escalier, V., Viari, A., and Soldano, H. 1995. Searching for repeated words in a text allowing for mismatches and gaps. In Baeza-Yates, R., and Manber, U., eds. Second South American Workshop on String Processing 87-100, Vinas del Mar, Chili, University of Chili.
19. Sagot, M.-F., and Viari, A. 1996. A double combinatorial approach to discovering patterns in biological sequences. In Hirschberg, D., and Myers, G., eds. Combinatorial Pattern Matching, volume 1075 of Lecture Notes in Computer Science 186-208, Springer-Verlag.
20. Sagot, M.-F., Viari, A., and Soldano, H. 1997. Multiple comparison: A peptide matching approach. Theoret. Comput. Sci. 180, 115-137, presented at Combinatorial Pattern Matching 1995.
21. Wells, R.D., and Sinden, R.R. 1993. Defined ordered sequence DNA, DNA structure and DNA-directed mutation. In Davies, K.E., and Warren, S.T., eds. Genome Analysis, volume 7 of Genome Rearrangement and Stability 107-138. Cold Spring Harbor Laboratory Press.
22. Wu, S., Manber, U., and Myers, E. 1996. A sub-quadratic algorithm for approximate limited expression matching. Algorithmica 15, 50-67.