A fast parallel algorithm for finding the longest common sequence of multiple biosequences
<p>Abstract</p> <p>Background</p> <p>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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BMC
2006-12-01
|
| Series: | BMC Bioinformatics |