Titlebook: String Processing and Information Retrieval; 31st International S Zsuzsanna Lipták,Edleno Moura,Ricardo Baeza-Yates Conference proceedings

评论者

忘川河

,Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings,Most, if not all, such manipulations rely on the primitive . queries, a task of quickly returning the character at a specified position of the original uncompressed string without explicit decompression. While there are advanced data structures for random access to grammar-compressed strings that gu

吼叫

蔑视

Bounded-Ratio Gapped String Indexing,s of total length .. The goal of the query is to report all pairs of occurrences of . and . with a gap falling within .. An existing (conditional) lower bound reveals that any index with query time . must occupy almost quadratic space, where . is the output size. However, there are interesting speci

可能性

,Simultaneously Building and Reconciling a Synteny Tree,red evolutionary model involves . (i.e. acting on multiple genes) including duplications (D), losses (L), synteny fissions and transfers possibly going through unsampled or extinct species. Formally, given a set of syntenies in a set of genomes and a set . of consistent gene trees for the gene famil

affinity

,Quantum Algorithms for Longest Common Substring with a Gap,ngth at most ., where . is the length of the solution. At the same time, no subquadratic time quantum algorithm for the Longest Common Subsequence Problem is known, implying increasing difficulty as gaps are allowed within the solution. In this work, we consider the problem of finding two ordered ma

Nutrient

,Online Computation of String Net Frequency,ntly, Guo et al. [CPM 2024] showed that NF is combinatorially interesting and how two key questions can be computed efficiently in the . setting. First, .: reporting the NF of a query string in an input text. Second, .: reporting an occurrence and the NF of each string of positive NF in an input tex

Urgency

comely

NATTY

,All-Pairs Suffix-Prefix on Dynamic Set of Strings, problem asks one to compute the longest suffix of . that is a prefix of . for all . ordered pairs . of strings in .. In this paper, we consider the . version of the APSP problem that allows for insertions of new strings to the set of strings. Our objective is, each time a new string . arrives to th