The constrained shortest common supersequence problem
From MaRDI portal
Publication:396654
DOI10.1016/j.jda.2013.03.004zbMath1334.68316MaRDI QIDQ396654
Publication date: 13 August 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2013.03.004
computational complexity; approximation algorithms; fixed-parameter algorithms; shortest common supersequence
68Q25: Analysis of algorithms and problem complexity
68W25: Approximation algorithms
68W32: Algorithms on strings