Finding flexible patterns in a text: an application to three-dimensional molecular matching
1Atelier de Bioinformatique, CPASO-URA CNRS 448, Section de Physique et Chimie de I'Institut Curie 11 Rue P. et M. Curie, 75005 Paris
2LIPN-Universiteé Paris Nord URA CNRA 1507, Avenue J.B. Cleé, 93430 Villetaneuse
3Institute Gaspard Monge, Université de Marne la Vallèe, 2 rue de la Butte Verte, 93160 Noisy le Grand France
Finding certain regularities in a text is an important problem in many areas, e.g. in the analysis of biological molecules such as nucleic acids or proteins. In the latter case, the text may be sequences of amino acids or a linear coding of three-dimensional structures, and the regularities then correspond to lexical or structural motifs common to two, or more, proteins. We first recall an earlier algorithm that found these regularities in a flexible way. Then we introduce a generalized version of this algorithm designed for the particular case of protein three-dimensional structures, since these structures present a few peculiarities that make them computationally harder to process. Finally, we give some applications of our new algorithm on concrete examples
Received on June 20, 1994; accepted on October 1, 1994