Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"Longest Common Subsequence problem"”.
-
On the probabilistic longest common subsequence problem for sequences of independent blocks
… of each other. Let Ln denote the length of the Longest Common Subsequence (LCS) of X and Y. In general the order of magnitude in n of VAR[Ln] is not known. So far, Matzinger and his collaborators had been able to prove that VAR[Ln] has order asymptotic n in few cases depending on the …
-
Optimal payoff to ensure opacity in Discrete-Event Systems
… applications). Thus, to solve the complexity problem we propose using a dynamic programming approach, which relies on the solution to the longest common subsequence problem. This approach can lower the complexity of the solution at least for some cases (namely, systems with no loops). …