The longest filled common subsequence problem

From MaRDI portal

Publication:5110878

Jump to:navigation, search

DOI10.4230/LIPIcs.CPM.2017.14zbMath1434.68728OpenAlexW2742408471MaRDI QIDQ5110878

Italo Zoppis, Mauro Castelli, Riccardo Dondi, Giancarlo Mauri

Publication date: 25 May 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.CPM.2017.14

zbMATH Keywords

computational complexity approximation algorithms fixed-parameter algorithms longest common subsequence

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Algorithms on strings (68W32) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

Unnamed Item ⋮ Comparing incomplete sequences via longest common subsequence

This page was built for publication: The longest filled common subsequence problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5110878&oldid=19632505"