.png){kind=icon}
返回
String search experimentation using massive data
.png){kind=icon}
OA
AI
DOI：10.1098/rsta.2013.0135.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Descriptions of new string search or indexing algorithms are often accompanied by an experimental evaluation. In this article, we provide guidance as to how such investigations can be carried out, drawing on our experience of measurement in this field. In particular, we describe methodologies for stratifying patterns according to their length and frequency, so that precise response-time measurements can be made; and we describe a metric for categorizing the extent of 'repetitiveness' in a text, so that dataset type can also be factored into evaluations. We show that separating these concepts allows a greater understanding of the behaviour of string search algorithms.
Keyword:
pattern search
string indexing
experimental evaluation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
P
IF:
3.7
论文数:
7.7K
被引数:
2.8W
机构
.png){kind=icon}
