✦ LIBER ✦

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

✍ Scribed by Guillaume Blin; Paola Bonizzoni; Riccardo Dondi; Florian Sikora

Book ID: 113663311
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 149 KB
Volume: 112
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2011.12.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the longest common parameterized subs

On the longest common parameterized subsequence

✍ Orgad Keller; Tsvi Kopelowitz; Moshe Lewenstein 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 484 KB

A hybrid genetic algorithm for the repet

A hybrid genetic algorithm for the repetition free longest common subsequence problem

✍ Castelli, Mauro; Beretta, Stefano; Vanneschi, Leonardo 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 429 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

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

High precision simulations of the longes

High precision simulations of the longest common subsequence problem

✍ R. Bundschuh 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 205 KB

Analysis of Evolutionary Algorithms for

Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem

✍ Thomas Jansen; Dennis Weyland 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 429 KB