Titlebook: String Processing and Information Retrieval; 26th International S Nieves R. Brisaboa,Simon J. Puglisi Conference proceedings 2019 Springer

BET

剥皮

群居动物

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

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

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

凹处

冥想后

Weighted Shortest Common Supersequence Problem Revisitedtest Common Supersequence (WSCS) problem, introduced by Amir et al. [SPIRE 2011], 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

使无效

陈旧