Research indexJournal article
Efficient parallel algorithms for processing biological sequences
Rajasekaran, Ammar, Shin and 1 other
30 Nov 2004
NobleIDark:/48914/w1/20260521/DF5B0442DOI10.1109/isspit.2003.1341164
Efficient parallel algorithms for processing biological sequences
Rajasekaran, Ammar, Shin and 1 other · 2004 · Subscription
NobleIDark:/48914/w1/20260521/DF5B0442DOI10.1109/isspit.2003.1341164
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
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.