Application-specific array processors for the longest common subsequence problem of three sequences.
We design linear time systolic-based parallel algorithms that run on two-dimensional arrays for both computing the length and recovering a longest common subsequence of three given sequences that are appropriate for very large-scale integration (VLSI) implementation. These problems have been qualifi...
| Wydane w: | Parallel algorithms and applications. 13, 1 (1998). |
|---|---|
| 1. autor: | |
| Format: | Artykuł |
| Język: | English |
| Hasła przedmiotowe: |