A fast parallel algorithm for finding the longest common sequence of multiple biosequences
Searching for the longest common sequence (LCS) of multiple biosequences is one of the most fundamental tasks in bioinformatics. In this paper, we present a parallel algorithm named FAST_LCS to speedup the computation for finding LCS. A fast parallel algorithm for LCS is presented. The algorithm fir...
Saved in:
| Published in: | BMC bioinformatics Vol. 7; no. S4; p. S4 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
England
BioMed Central
12.12.2006
BMC |
| Subjects: | |
| ISSN: | 1471-2105, 1471-2105 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!