Matching relational patterns in nucleic acid sequences (original) (raw)

Journal Article

,

Unité de Programmation Moléculaire et Toxicologie Génétique

CNRS UA271, INSERM U163

Search for other works by this author on:

1

Unité de Biochimie Cellulaire

CNRS UA1129, Institut Pasteur, 28 rue du Docteur Roux, Paris 75015, France

Search for other works by this author on:

Received:

25 September 1986

• PDF
• Split View
• • Article contents
  • Figures & tables
  • Video
  • Audio
  • Supplementary Data

Navbar Search Filter Mobile Enter search term Search

Abstract

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.

This content is only available as a PDF.

© 1987 IRL Press Ltd.

Citations

Views

Altmetric

Metrics

Total Views 16

1 Pageviews

15 PDF Downloads

Since 8/1/2017

×

Email alerts

Citing articles via

• Latest

• Most Read

• Most Cited

More from Oxford Academic