Approximate matching of secondary structures

This talk presents an algorithm to search for all approximate matches of a helix in a genome, where a helix is a combination of sequence and folding constraints. It is a joint work with Nadia El-Mabrouk of University of Montr?eal and was presented at the RECOMB 2002 congress [1]. The method applies for more general secondary RNA structures including several helices.

• Type: Conference
• Year: 2002
• Where: RECOMB
• Authors: Nadia El-Mabrouk, Mathieu Raffinot
• Keywords: Approximate Matches, Computational Biology, General Secondary Rna, RECOMB 2002, RECOMB 2002 Congress