Liu, Wei and Chen, Ling and Zou, Lingjun (2010) A Parallel LCS Algorithm for Biosequences Alignment. In: 2nd International ICST Conference on Scalable Information Systems.
![[thumbnail of 13977.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "13977.pdf")
PDF
13977.pdf
Download (285kB)
Abstract
Searching for the longest common substring (LCS) of biosequences is one of the most important tasks in Bioinformatics. A fast algorithm for LCS problem named FAST_LCS is presented. The algorithm first seeks the successors of the initial identical character pairs according to a successor table to obt
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Date Deposited: | 04 Mar 2026 09:22 |
| Last Modified: | 18 Apr 2026 04:16 |
| URI: | http://eprints.eai.eu/id/eprint/5616 |
Actions (login required)
- View Item