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 Penotti, F. E.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Penotti, F. E.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© Oxford University Press

A distributed system for DNA/protein database similarity searches

Fabio E. Penotti

Consiglio Nazionale delle Ricerche, Istituto Tecnologie Informatiche Multimedia Via Ampere 56, I-20131 Milano MI, Italy

A distributed system for exhaustive alignment similarity seraches on DNA/protein databases is presented. The system makes it possible to share the computational burden on diverse computers, provided they are interconnected by a network supporting TCP/IP communication. It consists of three separate programs: a user-interface module, a similarity score calculation module (multiple instances of which may be running simultaneously on different machines), and a control module. This last acts as the ‘hub’ of the system. The three programs have been successfully tested under the AIX, SunOS, VAX/VMS and MS/DOS operating systems.

Received on September 8, 1993; accepted on February 8, 1994

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.