Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence

Research output: Contribution to journalArticle

Fingerprint Dive into the research topics of 'Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science