The longest common subsequence (LCS) problem, a long‐standing challenge in computer science and bioinformatics, seeks to identify the maximum sequence of characters shared by multiple strings ...

In this work, we present an algorithm for computing the lcs in the description logic ALEN which comprises both constructors--number and existential restrictions--as well as concept conjunction, ...