Results 211 to 220 of about 5,599,259 (245)

On the Set LCS and Set-Set LCS Problems

Journal of Algorithms, 1993
Summary: We consider two generalizations of the longest common subsequence (LCS) problem: the Set LCS problem and the Set-Set LCS problem. We present algorithms for the two problems that are faster than the previous ones by \textit{D. S. Hirschberg} and \textit{L. L. Larmore} [Algorithmica 2, 91-95 (1987; Zbl 0642.68065); ibid. 4, No. 4, 503-510 (1989;
Wang, B. F., Park, K., Chen, Gen-Huey
openaire   +4 more sources

Free sets for set‐mappings relative to a family of sets

Mathematical Logic Quarterly, 2017
AbstractGiven a family of subsets of , we try to compute the least natural number n such that for every function there exists a bijection such that for all .
Antonio Avilés, Claribet Piña
openaire   +3 more sources