Finding flexible patterns in a text: an application to three-dimensional molecular matching.
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.
Sagot
M F
MF
Atelier de BioInformatique, CPASO-URA CNRS 448, Section de Physique et Chimie de l'Institut Curie, Paris, France.
Viari
A
A
Pothier
J
J
Soldano
H
H
D000465:Algorithms; D003577:Cytochrome P-450 Enzyme System / Q000737:chemistry; D016208:Databases, Factual; D008958:Models, Molecular; D015233:Models, Statistical; D015394:Molecular Structure; D010363:Pattern Recognition, Automated; D011487:Protein Conformation; D011506:Proteins / Q000737:chemistry*; D016415:Sequence Alignment / Q000379:methods / Q000706:statistics & numerical data
D011506:Proteins; D003577:Cytochrome P-450 Enzyme System