By Topic

Design and implementation of parallel algorithms for gene-finding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
J. Puthukattukaran ; Dept. of Electr. & Comput. Eng., Wisconsin Univ., Madison, WI, USA ; S. Chalasani ; P. Senapathy

Finding genes unequivocally in DNA sequences is one of the key goals of the Human Genome project. The human genome is a 3 billion character long DNA sequence and is estimated to contain about 100000 genes. It has been shown by several biologists that genes in a DNA sequence satisfy certain special properties. We use a combination of these properties to design a serial algorithm for gene-finding. To speed up the process of finding genes in long DNA sequences (of the order of ⩾100000 characters), we design a parallel algorithm for gene-finding. We have implemented the parallel gene-finding algorithm on the CM-5 multicomputer as well as on a network of HP Apollo workstations under Parallel Virtual Machine software package. Experimental results indicate that our algorithms predict genes with reasonable accuracy

Published in:

High Performance Distributed Computing, 1994., Proceedings of the Third IEEE International Symposium on

Date of Conference:

2-5 Aug 1994