“…(c) LCS = { abd, {ad} , abcd, {acd} } 8. The output of the previous sub-call is incorporated to the labeled closed sets, which is the final output of the algorithm: LCS = { ∅, {∅} , a, {a} , c, {c} , d, {d} , ac, {ac} , cd, {cd} , bd, {b} , abd, {ab, ad} , abcd, {bc, acd} }This method is strongly based on the SL F D Closure algorithm introduced in[33], and is based on Theorem 2 and the following proposition.…”