A linear-space data structure for range-LCP queries in poly-logarithmic time

Abedin Paniz; Ganguly Arnab; Hon Wing-Kai; Matsuda Kotaro; Nekrich Yakov; Sadakane Kunihiko; Shah Rahul; Thankachan Sharma V

首页> 外文期刊>Theoretical computer science >A linear-space data structure for range-LCP queries in poly-logarithmic time

【24h】

A linear-space data structure for range-LCP queries in poly-logarithmic time

机译：多对数时间范围-LCP查询的线性空间数据结构

获取原文

获取原文并翻译 | 示例

获取外文期刊封面封底 >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

Let T[1, n] be a text of length n and T[i, n] be the suffix starting at position i. Also, for any two strings X and Y, let LCP(X, Y) denote their longest common prefix. The range-LCP of T w.r.t. a range [alpha, beta], where 1 <= alpha < beta <= n is

机译：设t [1，n]是长度n和t [i，n]的文本是从位i的后缀开始。此外，对于任何两个字符串x和y，Let LCP（x，y）表示它们最长的常见前缀。 t w.r.t的范围-LCP。范围α，其中1 <= alpha

著录项

来源
《Theoretical computer science》 |2020年第2020期|共8页
作者
Abedin Paniz; Ganguly Arnab; Hon Wing-Kai; Matsuda Kotaro; Nekrich Yakov; Sadakane Kunihiko; Shah Rahul; Thankachan Sharma V;
展开▼
作者单位

Univ Cent Florida Dept Comp Sci Orlando FL 32816 USA;

Univ Wisconsin Dept Comp Sci Whitewater WI 53190 USA;

Natl Tsing Hua Univ Dept Comp Sci Hsinchu Taiwan;

Univ Tokyo Dept Comp Sci Tokyo Japan;

Univ Waterloo Cheriton Sch Comp Sci Waterloo ON Canada;

Univ Tokyo Dept Comp Sci Tokyo Japan;

Louisiana State Univ Dept Comp Sci Baton Rouge LA 70803 USA;

Univ Cent Florida Dept Comp Sci Orlando FL 32816 USA;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类计算技术、计算机技术;
关键词
Range query; Heavy path decomposition; Suffix tree;

机译：范围查询;重路径分解;后缀树;

相似文献

外文文献
中文文献
专利

1. A linear-space data structure for range-LCP queries in poly-logarithmic time [J] . Abedin Paniz, Ganguly Arnab, Hon Wing-Kai, Theoretical computer science . 2020,第期

机译：多对数时间范围-LCP查询的线性空间数据结构
2. Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees [J] . Durocher Stephane, Shah Rahul, Skala Matthew, Algorithmica . 2016,第1期

机译：数组和树上范围频率查询的线性空间数据结构
3. Linear-Space Data Structures for Range Minority Query in Arrays [J] . Chan Timothy M., Durocher Stephane, Skala Matthew, Algorithmica . 2015,第4期

机译：数组中距离少数查询的线性空间数据结构
4. A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time [C] . Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, International computing and combinatorics conference . 2018

机译：多对数时间范围内LCP查询的线性空间数据结构
5. Query-time optimization techniques for structured queries in information retrieval. [D] . Cartright, Marc-Allen. 2013

机译：信息检索中用于结构化查询的查询时间优化技术。
6. Knowledge and Theme Discovery across Very Large Biological Data Sets Using Distributed Queries: A Prototype Combining Unstructured and Structured Data [O] . Uma S. Mudunuri, Mohamad Khouja, Stephen Repetski, -1

机译：使用分布式查询跨非常大的生物数据集进行知识和主题发现：结合非结构化和结构化数据的原型
7. A simple linear-space data structure for constant-time range minimum query [O] . Stephane Durocher, Robby Singh 2019

机译：用于恒定时间范围最小查询的简单线性空间数据结构
8. Querying Databases of Trajectories of Differential Equations: Data Structures for Trajectories [R] . Grossman, R. 1989

机译：查询微分方程轨迹数据库：轨迹的数据结构

A linear-space data structure for range-LCP queries in poly-logarithmic time

摘要

著录项

相似文献

相关主题

期刊订阅