✦ LIBER ✦

On the longest common parameterized subsequence

✍ Scribed by Orgad Keller; Tsvi Kopelowitz; Moshe Lewenstein

Book ID: 108281586
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 484 KB
Volume: 410
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.09.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the parameterized complexity of the r

On the parameterized complexity of the repetition free longest common subsequence problem

✍ Guillaume Blin; Paola Bonizzoni; Riccardo Dondi; Florian Sikora 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 149 KB

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

Exemplar Longest Common Subsequence

✍ Bonizzoni, P.; Vedova, G.D.; Dondi, R.; Fertin, G.; Rizzi, R.; Vialette, S. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 431 KB

On the Longest Common Rigid Subsequence

On the Longest Common Rigid Subsequence Problem

✍ Nikhil Bansal; Moshe Lewenstein; Bin Ma; Kaizhong Zhang 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 320 KB

The constrained longest common subsequen

The constrained longest common subsequence problem

✍ Yin-Te Tsai 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 173 KB

On the generalized constrained longest c

On the generalized constrained longest common subsequence problems

✍ Yi-Ching Chen; Kun-Mao Chao 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 443 KB