Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeats, pseudoknots and triple helices

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

Volumn 1264, Issue , 1997, Pages 224-246

  Sagot, Marie France ^a,b   Viari, Alain ^b  

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

^b SORBONNE UNIVERSITÉ   (France)

Author keywords

(complementary) inverse occurrence; Approximate comparison; Direct occurrence; Mirror repeat; Model; Nucleic acid sequence; Nucleic structural object; Palindrome; Pseudoknot; Triple helix

Indexed keywords

BIOINFORMATICS; LINGUISTICS; MIRRORS; MODELS; NUCLEOTIDES; PATTERN MATCHING;

(COMPLEMENTARY) INVERSE OCCURRENCE; APPROXIMATE COMPARISON; DIRECT OCCURRENCE; PALINDROME; PSEUDO-KNOTS; STRUCTURAL OBJECTS; TRIPLE HELIXES;

NUCLEIC ACID SEQUENCES;

EID: 84948976660     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63220-4_62     Document Type: Conference Paper

References (26)

1. J. P. Abrahams, M. V. d. Berg, E. V. Batenburg, and C. Pleij. Prediction of RNA secondary structure, including pseudoknotting, by computer simulation. Comput. Appli. Biosci., 8:243-248, 1992.
2. B. Billoud, M. Kontic, and A. Viari. Palingol: a declarative programming language to describe nucleic acids' secondary structures and to scan sequence databases. Nucleic Acids Res., 24:1395-1403, 1996.
3. D. Bouthinon, H. Soldano, and B. Billoud. Apprentissage d'un concept commun un ensemble d'objets dont la description est hypothétique: application à la d6couverte de structures secondaires d'ARN. In 11èmes Journées Françaises d'Apprentissage, 1996.
4. M. Brown and C. Wilson. RNA pseudoknot modeling using intersections of stochastic context free grammars with applications to database search, manuscript - University of California, Santa Cruz, Oct. 1995, 1995.
5. J.-H. Chen, S.-Y. Le, and J. V. Maizel. A procedure for RNA pseudoknot prediction. Comput. Appli. Biosci., 8:243-248, 1992.
6. D. J. Galas, M. Eggert, and M. S. Waterman. Rigorous pattern-recognition methods for DNA sequences. Analysis of promoter sequences from Escherichia coll. J. MoL Biol., 186:117-128, 1985.
7. I. Tinoco Jr., P. W. Davis, C. C. Hardin, J. D. Puglisi, G. T. Walker, and J. Wyatt. RNA structures from A to Z. In Cold Spring Harbor Symposia on Quantitative Biology, volume 52, pages 135-146. Cold Spring Harbor Laboratory, 1987.
8. N. A. Kolchanov, I. I. Titov, I. E. Vlassova, and V. V. Vlassov. Chemical and computer probing of RNA structure. In W. E. Cohn and K. Moldave, editors, Progress in Nucleic Acid Research and Molecular Biology, pages 131-196. Academic Press, 1996.
9. M. Kontic. Palingol. Langage pour la description et la recherche de structures secondaires dans les séquences nucléotidiques, 1993. DEA d'Intelligence Artificielle, Université de Paris Nord.
10. F. Lefebvre. An optimized parsing algorithm well suited for RNA folding. In Proceedings First International Conference on Intelligent Systems for Molecular Biology, Cambridge, England, 1995.
11. B. Lewin. Genes V. Oxford University Press, 1994.
12. H. M. Martinez. An efficient method for finding repeats in molecular sequences. Nucleic Acids Res., 11:4629-4634, 1983.
13. H. M. Martinez. Detecting pseudoknots and other local base-pairing structures in RNA sequences. 183:306-317, 1990.
14. S.M. Murkin, V.I. Lyamichev, K.N. Druhlyak, V.N. Dobrynin, S.A. Filipov, and M.D. Frank-Kamenetskii. DNA H form requires a homopurinehomopyrimidine mirror repeat. Nature, 330:495-497, 1987.
15. E. W. Myers. A sublinear algorithm for approximate keyword searching. Algorithmica, 12:345-374, 1994.
16. C. W. A. Pleij and L. Bosch. RNA pseudoknots: structure, detection, and prediction. 180:289-303, 1989.
17. M.-F. Sagot, V. Escalier, A. Viari, and H. Soldano. Searching for repeated words in a text allowing for mismatches and gaps. pages 87-100, Vifias del Mar, Chili, 1995. Second South American Workshop on String Processing.
18. M.-F. Sagot and A. Viari. A double combinatorial approach to discovering patterns in biological sequences. In D. Hirschberg and G. Myers, editors, Combinatorial Pattern Matching, volume 1075 of Lecture Notes in Computer Science, pages 186-208. Springer-Verlag, 1996.
19. M.-F. Sagot, A. Viari, and H. Soldano. A distance-based block searching algorithm, pages 322-331, Cambridge, England, 1995. Third International Symposium on Intelligent Systems for Molecular Biology.
20. M.-F. Sagot, A. Viari, and H. Soldano. Multiple comparison: a peptide matching approach. In Z. Galil and E. Ukkonen, editors, Combinatorial Pattern Matching, volume 937 of Lecture Notes in Computer Science, pages 366-385. Springer-Verlag, 1995. to appear in Theoret. Comput. Sci.
21. Y. Sakakibara, M. Brown, R. Hughey, I. S. Mian, K. Sjolander, R.. C. Underwood, and D. Haussler. Stochastic context-free grammars for tRNA modeling. Nucleic Acids Res., 22:5112-5120, 1994.
22. D. Searls. The linguistics of DNA. American Scientist, 80:579-591, 1992.
23. M. S. Waterman. Consensus methods for folding single-stranded nucleic acids. In M. S. Waterman, editor, Mathematical Methods for DNA Sequences, pages 185-224. CRC Press, 1989.
24. S. Wu, U. Manber, and E. W. Myers. An O(NP) sequence comparison algorithm. Inf. Proe. Letters, 35:317-323, 1990.
25. M. Zuker and D. Sankoff. RNA secondary structures and their prediction. Bull. Math. Biol., 46:591-621, 1984.
26. M. Zuker and P. Stiegler. Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information. Nucleic Acids Res., 9:133-148, 1981.