Cart (Loading....) | Create Account
Close category search window
 

Efficient parallel algorithms for processing biological sequences

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
$31 $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

4 Author(s)
Rajasekaran, S. ; Dept. of CSE, Connecticut Univ., CT, USA ; Ammar, R. ; Shin, D.G. ; Zhang, G.

Processing of biological sequences is a compute-intensive problem. The amount of data available in biology is enormous that sequential techniques will take a very long time to process them. In this paper we present many parallel algorithms for biological data processing. We consider a scenario where the operations performed on the sequences are arbitrary. In particular we assume that a sequential algorithm (or program) is given as an input (with the option of making several copies). The input consists of a file of sequences to be processed. The goal is to process all these sequences as efficiently as possible.

Published in:

Signal Processing and Information Technology, 2003. ISSPIT 2003. Proceedings of the 3rd IEEE International Symposium on

Date of Conference:

14-17 Dec. 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.