@InProceedings{conte_et_al:LIPIcs.ISAAC.2023.21,
author = {Conte, Alessio and Grossi, Roberto and Punzi, Giulia and Uno, Takeaki},
title = {{A Compact DAG for Storing and Searching Maximal Common Subsequences}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {21:1--21:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.21},
URN = {urn:nbn:de:0030-drops-193231},
doi = {10.4230/LIPIcs.ISAAC.2023.21},
annote = {Keywords: Maximal common subsequence, DAG, Compact data structures, Enumeration, Constant amortized time, Random access}
}