找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: HARDY
发表于 2025-3-25 07:02:39 | 显示全部楼层
Conference proceedings 2023 2023, held in Pisa, Italy, during September 26–28, 2023.  ..The 31 full papers presented were carefully reviewed and selected from 47 submissions. They cover topics such as: data structures; algorithms; constrained Substring complexity; data compression codes; succinct k-spectra; and LCP array of wheeler DFAs.. .
发表于 2025-3-25 08:27:36 | 显示全部楼层
发表于 2025-3-25 13:24:30 | 显示全部楼层
,Computing All-vs-All MEMs in Grammar-Compressed Text,strate that our MEM algorithm runs on top of . in . time and uses . bits, where . is the grammar size, and . is the number of MEMs in .. In the conclusions, we discuss how to modify our idea to perform approximate pattern matching in compressed space.
发表于 2025-3-25 19:32:52 | 显示全部楼层
发表于 2025-3-25 20:52:33 | 显示全部楼层
发表于 2025-3-26 03:39:02 | 显示全部楼层
,Count-Min Sketch with Variable Number of Hash Functions: An Experimental Study, regimes and under several representative probability distributions of input elements. On the other hand, we demonstrate improvements that can be made by assigning a variable number of hash functions to different elements. This includes, in particular, reduced space of the data structure while still supporting a small error.
发表于 2025-3-26 07:49:43 | 显示全部楼层
发表于 2025-3-26 10:25:46 | 显示全部楼层
,Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph,hout a text in .(.) worst-case time and words of working space. To obtain the above results, we devised techniques for enumerating a particular subset of suffixes in the lexicographic and text orders using the forward and backward search on the CDAWG by extending the result by Belazzougui . in 2015.
发表于 2025-3-26 13:25:56 | 显示全部楼层
发表于 2025-3-26 17:36:55 | 显示全部楼层
,Data Structures for SMEM-Finding in the PBWT,stored in a manner that allows for finding SMEMs. We estimate and compare the memory usage of these data structures, leading to one data structure that is most memory efficient. Lastly, we implement this data structure and compare its performance to prior methods using various datasets taken from the 1000 Genomes Project data.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-21 17:45
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表