Titlebook: String Processing and Information Retrieval; 25th International S Travis Gagie,Alistair Moffat,Ernesto Cuadros-Varga Conference proceedings

集合

Longest Common Prefixes with ,-Errors and Applications,icantly better than worst-case ones in most applications of interest. In this paper, we study the problem of computing the longest prefix of each suffix of a given string of length . that occurs elsewhere in the string with .-errors. This problem has already been studied under the Hamming distance m

exacerbate

Longest Property-Preserved Common Factor, all strings that preserves a specific property and has maximal length. Here we consider two fundamental string properties: square-free factors and periodic factors under two different settings, one per property. In the first setting, we are given a string . and we are asked to construct a data stru

Antagonism

Junction

Indexed Dynamic Programming to Boost Edit Distance and LCSS Computation,pically in time within .(.) in the worst-case over strings of respective lengths . and . (which is likely to be optimal), and in time within . in some special cases (e.g., disjoint alphabets). We describe how indexing the strings (in linear time), and using such an index to refine the recurrence for

Stricture

制定

crucial

deforestation

Carminative

Muscularis