Skip Navigation

This Article
Right arrow Full Text (Print 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 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 Saurin, W.
Right arrow Articles by Marlière, P.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Saurin, W.
Right arrow Articles by Marlière, P.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 1987 IRL Press Ltd.

Matching relational patterns in nucleic acid sequences

William Saurin and Philippe Marlière 1

Unité de Programmation Moléculaire et Toxicologie Génétique CNRS UA271, INSERM U163
1Unité de Biochimie Cellulaire CNRS UA1129, Institut Pasteur, 28 rue du Docteur Roux, Paris 75015, France

We describe a program that efficiently searches sequence data banks for complex patterns where sites are linked by common relations such as identity, complementarity or span. Its algorithm is closer to those of automatic demonstration than to the finite state machines used in fast pattern matching. The repertory of relations can be enriched at will without rewriting the core of the program. The program is written in Pascal-ISO and runs on a microcomputer.


Received on September 25, 1986; accepted on April 30, 1987

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.