Finding diverse strings and longest common subsequences in a graph

DOI10.4230/LIPICS.CPM.2024.27MaRDI QIDQ6891067zbMATH OpenFDO

Authors Yuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura

Publication date 2 December 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

dispersionHamming distanceapproximation algorithmslongest common subsequenceparameterized complexitysequence analysis

Mathematics Subject Classification ID

Algorithms on strings (68W32)

This page was built for publication: Finding diverse strings and longest common subsequences in a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891067)