A Compact DAG for Storing and Searching Maximal Common Subsequences

Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno. A Compact DAG for Storing and Searching Maximal Common Subsequences. In Satoru Iwata 0001, Naonori Kakimura, editors, 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan. Volume 283 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

Authors

Alessio Conte

This author has not been identified. Look up 'Alessio Conte' in Google

Roberto Grossi

This author has not been identified. Look up 'Roberto Grossi' in Google

Giulia Punzi

This author has not been identified. Look up 'Giulia Punzi' in Google

Takeaki Uno

This author has not been identified. Look up 'Takeaki Uno' in Google