Titlebook: String Processing and Information Retrieval; 30th International S Franco Maria Nardini,Nadia Pisanti,Rossano Venturi Conference proceedings

intoxicate

保守

forager

慢跑鞋

,From de Bruijn Graphs to Variation Graphs – Relationships Between Pangenome Models, strings. We show the relationship between variation graphs satisfying these criteria and de Bruijn graphs. This relationship can be used to efficiently build a variation graph representing a given set of genomes, transfer annotations between both models or compare the results of analyzes based on each model.

锉屑

,Longest Common Prefix Arrays for Succinct ,-Spectra,cs including pseudoalignment and genome assembly. The . (SBWT) has been recently introduced as an algorithmic tool to efficiently represent and query these objects. The longest common prefix (.) array for a .-spectrum is an array of length . that stores the length of the longest common prefix of adj

INERT

On Suffix Tree Detection,e ., which its research aims at reducing this gap, is the following. Given an ordered rooted tree . with unlabeled edges, determine whether there exists a string . such that the unlabeled-edges suffix tree of . is isomorphic to .. Previous studies on this problem consider the relaxation of having th

都相信我的话

,Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph,ected Acyclic Word Graph (CDAWG), of size . for a text . of length . into other text indexing structures for the same text, suitable for highly repetitive texts: the . of size ., the . of size ., and the . of size ., as well as the . of size .(.) and the . of size ., where .. As main results, we sho

旧石器时代

,Evaluating Regular Path Queries on Compressed Adjacency Matrices, graph database query languages like SPARQL. A way to solve RPQs is to translate them into a sequence of operations on the adjacency matrices of each label. We design and implement a Boolean algebra on sparse matrix representations and, as an application, use them to handle RPQs. Our baseline repres

FRONT

Approximate Cartesian Tree Matching: An Approach Using Swaps,ist theoretical and practical solutions for the exact case. In this paper, we propose the first algorithm for solving approximate Cartesian tree pattern matching. We consider Cartesian tree pattern matching with one swap: given a pattern of length . and a text of length . we present two algorithms t

Notify

Optimal Wheeler Language Recognition,node paths). A . is a regular language admitting an accepting Wheeler automaton. Wheeler languages admit efficient and elegant solutions to hard problems such as automata compression and regular expression matching, therefore deciding whether a regular language is Wheeler is relevant in applications