BET
发表于 2025-3-25 06:17:52
http://reply.papertrans.cn/88/8798/879720/879720_21.png
剥皮
发表于 2025-3-25 10:49:13
http://reply.papertrans.cn/88/8798/879720/879720_22.png
群居动物
发表于 2025-3-25 15:00:36
On Longest Common Property Preserved Substring Queriesalized and unified on-line setting, where we are given a set . of . strings of total length . that can be pre-processed so that, given a query string . and a positive integer ., we can determine the longest substring of . that satisfies some specific property and is common to at least . strings in .
garrulous
发表于 2025-3-25 16:53:27
Online Algorithms on Antipowers and Antiperiodsof the same length. Recently, Alamro et al. (CPM 2019) defined a string to have an . if it is a prefix of an antipower, and gave complexity bounds for the offline computation of the minimum antiperiod and all the antiperiods of a word. In this paper, we address the same problems in the . setting. Ou
Infirm
发表于 2025-3-25 20:52:10
Polynomial-Delay Enumeration of Maximal Common Subsequences of Longest Common Subsequence (LCS), which can be seen as a longest MCS. We study the problem of efficiently listing all the . MCSs between two strings. As discussed in the paper, this problem is algorithmically challenging as the same MCS cannot be listed multiple times: for example, dynamic progr
凹处
发表于 2025-3-26 02:23:01
http://reply.papertrans.cn/88/8798/879720/879720_26.png
冥想后
发表于 2025-3-26 08:22:36
Weighted Shortest Common Supersequence Problem Revisitedtest Common Supersequence (WSCS) problem, introduced by Amir et al. , that is, the SCS problem on weighted strings. In the WSCS problem, we are given two weighted strings . and . and a threshold . on probability, and we are asked to compute the shortest (standard) string . such that both
ADORE
发表于 2025-3-26 10:22:43
http://reply.papertrans.cn/88/8798/879720/879720_28.png
使无效
发表于 2025-3-26 13:41:05
http://reply.papertrans.cn/88/8798/879720/879720_29.png
陈旧
发表于 2025-3-26 18:00:39
http://reply.papertrans.cn/88/8798/879720/879720_30.png