Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Waldispühl, J.
Right arrow Articles by Steyaert, J.-M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Waldispühl, J.
Right arrow Articles by Steyaert, J.-M.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 18 no. 90002 2002
Pages S250-S259
© 2002 Oxford University Press

An approximate matching algorithm for finding (sub-)optimal sequences in S-attributed grammars

J. Waldispühl 1, B. Behzadi 1 and J.-M. Steyaert 1

1 École Polytechnique, Palaiseau, 91128, France

Received on April 8, 2002 ; accepted on June 15, 2002

Motivation: S-attributed grammars (a generalization of classical Context-Free grammars) provide a versatile formalism for sequence analysis which allows to express long range constraints: the RNA folding problem is a typical example of application. Efficient algorithms have been developed to solve problems expressed with these tools, which generally compute the optimal attribute of the sequence w.r.t. the grammar. However, it is often more meaningful and/or interesting from the biological point of view to consider almost optimal attributes as well as approximate sequences; we thus need more flexible and powerful algorithms able to perform these generalized analyses.

Results: In this paper we present a basic algorithm which, given a grammar G and a sequence {omega}, computes the optimal attribute for all (approximate) strings {omega}' L(G) such that d({omega}, {omega}')<= M, and whose complexity is (nr+1) in time and (n2) in space (r is the maximal length of the right-hand side of any production of G). We will also give some extensions and possible improvements of this algorithm.

Keywords: S-Attribute Grammar, Approximate matching, Dynamic Algorithm.

Contact: waldispu{at}lix.polytechnique.fr


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.