On the use of decision diagrams for finding repetition-free longest common subsequences
From MaRDI portal
Publication:2679779
DOI10.1007/978-3-030-62867-3_11zbMath1506.92065OpenAlexW3096862630MaRDI QIDQ2679779
Christian Blum, Marko Djukanovic, Günther R. Raidl, Matthias Horn
Publication date: 25 January 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-62867-3_11
This page was built for publication: On the use of decision diagrams for finding repetition-free longest common subsequences