Titlebook: String Processing and Information Retrieval; 27th International S Christina Boucher,Sharma V. Thankachan Conference proceedings 2020 Spring

Abrade

Longest Square Subsequence Problem Revisiteds using . time [Tiskin 2013]. We present the first algorithm for LSS whose running time depends on other parameters, i.e., we show that an LSS of . can be computed in . time with .(.) space, where . is the length of an LSS of . and . is the number of matching points on ..

chiropractor

On Repetitiveness Measures of Thue-Morse Words which is a measure of repetitiveness recently studied by Kociumaka et al. [LATIN 2020]. Furthermore, we show that the number . of factors in the self-referencing Lempel-Ziv factorization of . is exactly 2..

stress-response

0302-9743 om 32 submissions. They cover topics such as: data structures; algorithms; information retrieval; compression; combinatorics on words; and computational biology..978-3-030-59211-0978-3-030-59212-7Series ISSN 0302-9743 Series E-ISSN 1611-3349

以烟熏消毒

An Efficient Elastic-Degenerate Text Index? Not Likely constants . and . where . or . would violate OVH. Additionally, we provide an elastic-degenerate text index with query time ., which is independent of the size . (distinct from its length) of the elastic-degenerate text. Finally, we investigate the hardness of matching elastic-degenerate text to elastic-degenerate text.