Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

RECOMB
2002
Springer

favoriteEmaildiscussreport

123views Computational Biology» more RECOMB 2002»

Approximate matching of secondary structures

14 years 10 months ago

Approximate matching of secondary structures

Download algo.inria.fr

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.

Nadia El-Mabrouk, Mathieu Raffinot

Real-time Traffic

Approximate Matches | Computational Biology | General Secondary Rna | RECOMB 2002 | RECOMB 2002 Congress |

claim paper

Related Content

» A 2approximation for the precedingandcrossing structured 2interval pattern problem

» An Iterated loop matching approach to the prediction of RNA secondary structures with pseu...

» Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary P...

» Approximation Algorithms for Optimal RNA Secondary Structures Common to Multiple Sequences

» Probabilistic structural alignment of RNA sequences

» PALSSE A program to delineate linear secondary structural elements from protein structures

» Accurate prediction of protein secondary structure and solvent accessibility by consensus ...

» Prediction of RNA secondary structure by maximizing pseudoexpected accuracy

» Identification of consensus RNA secondary structures using suffix arrays

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2002
Where	RECOMB
Authors	Nadia El-Mabrouk, Mathieu Raffinot

Comments (0)