𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New systolic arrays for the longest common subsequence problem

✍ Scribed by Yen-Chun Lin

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
555 KB
Volume
20
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The longest common subsequence problem f
The longest common subsequence problem for sequences with nested arc annotations
✍ Guohui Lin; Zhi-Zhong Chen; Tao Jiang; Jianjun Wen πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 254 KB

Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. The Longest Arc-Preserving Common Subsequence (LAPCS) Problem has been introduced in Evans (Algorithms and complexity for annotated sequence analysis, Ph.D. Thesis, University of Victoria, 199

On the parameterized complexity of the f
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
✍ Krzysztof Pietrzak πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 205 KB

We show that the fixed alphabet shortest common supersequence (SCS) and the fixed alphabet longest common subsequence (LCS) problems parameterized in the number of strings are W ½1-hard. Unless W ½1 ¼ FPT; this rules out the existence of algorithms with time complexity of Oð f ðkÞn a Þ for those pro