咨询与建议

限定检索结果

文献类型

  • 195 篇 会议
  • 23 篇 期刊文献

馆藏范围

  • 218 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 214 篇 工学
    • 213 篇 计算机科学与技术...
    • 175 篇 软件工程
    • 17 篇 生物工程
    • 10 篇 电气工程
    • 8 篇 电子科学与技术(可...
    • 8 篇 信息与通信工程
    • 7 篇 生物医学工程(可授...
    • 6 篇 控制科学与工程
    • 3 篇 机械工程
    • 2 篇 农业工程
    • 1 篇 光学工程
    • 1 篇 仪器科学与技术
    • 1 篇 材料科学与工程(可...
    • 1 篇 动力工程及工程热...
    • 1 篇 化学工程与技术
    • 1 篇 林业工程
  • 174 篇 理学
    • 172 篇 数学
    • 21 篇 生物学
    • 6 篇 统计学(可授理学、...
    • 4 篇 物理学
    • 2 篇 化学
  • 24 篇 管理学
    • 19 篇 图书情报与档案管...
    • 6 篇 管理科学与工程(可...
  • 4 篇 医学
    • 4 篇 临床医学
    • 1 篇 基础医学(可授医学...
    • 1 篇 药学(可授医学、理...
  • 3 篇 法学
    • 3 篇 社会学
  • 2 篇 农学
    • 2 篇 作物学
  • 1 篇 教育学
    • 1 篇 教育学
  • 1 篇 文学
    • 1 篇 新闻传播学

主题

  • 218 篇 string searching...

机构

  • 6 篇 department of bi...
  • 5 篇 department of co...
  • 4 篇 computer technol...
  • 3 篇 presto japan sci...
  • 3 篇 department of in...
  • 3 篇 univ chile dept ...
  • 2 篇 institute for co...
  • 2 篇 school of inform...
  • 2 篇 information scie...
  • 2 篇 department of in...
  • 2 篇 georgia inst tec...
  • 2 篇 information scie...
  • 2 篇 department of co...
  • 2 篇 dipartimento di ...
  • 2 篇 univ rouen norma...
  • 2 篇 department of in...
  • 2 篇 department of co...
  • 2 篇 univ liverpool d...
  • 2 篇 courant institut...
  • 2 篇 department of co...

作者

  • 11 篇 fan hongbo
  • 7 篇 breslauer dany
  • 7 篇 faro simone
  • 6 篇 liu lijun
  • 6 篇 crochemore maxim...
  • 6 篇 huang qingsong
  • 5 篇 tarhio jorma
  • 5 篇 agarwal suneeta
  • 5 篇 prasad rajesh
  • 5 篇 lecroq thierry
  • 4 篇 yao nianmin
  • 4 篇 peltola hannu
  • 4 篇 takeda masayuki
  • 4 篇 inenaga shunsuke
  • 4 篇 iliopoulos costa...
  • 4 篇 navarro gonzalo
  • 4 篇 nakashima yuto
  • 4 篇 grossi roberto
  • 4 篇 grabowski szymon
  • 3 篇 manea florin

语言

  • 205 篇 英文
  • 11 篇 其他
  • 2 篇 中文
检索条件"主题词=String Searching Algorithms"
218 条 记 录,以下是21-30 订阅
排序:
Prevalent Exact string-Matching algorithms in Natural Language Processing: A Review
Prevalent Exact String-Matching Algorithms in Natural Langua...
收藏 引用
2020 International Conference on Future of Engineering Systems and Technologies, FEST 2020
作者: Pandey, R.K. Taruna, S. Department of Computer Science Jk Lakshmipat University Jaipur India
string matching and searching problems are one of the classical hitches to the domain of computer engineering. There exist numerous variants of such algorithms, which can be categorized into dual classes;i.e. an appro... 详细信息
来源: 评论
Reversible Programming: A Case Study of Two string-Matching algorithms
arXiv
收藏 引用
arXiv 2022年
作者: Glück, Robert Yokoyama, Tetsuo DIKU Department of Computer Science University of Copenhagen Denmark Dept. of Electronics and Communication Technology Nanzan University Japan
string matching is a fundamental problem in algorithm. This study examines the development and construction of two reversible string-matching algorithms: a naive string-matching algorithm and the Rabin-Karp algorithm.... 详细信息
来源: 评论
Near-Optimal Quantum Algorithm for Finding the Longest Common Substring between Run-Length Encoded strings
arXiv
收藏 引用
arXiv 2024年
作者: Lee, Tzu-Ching Lin, Han-Hsuan National Tsing Hua University Taiwan
We give a near-optimal quantum algorithm for the longest common substring (LCS) problem between two run-length encoded (RLE) strings, with the assumption that the prefix-sums of the run-lengths are given. Our algorith... 详细信息
来源: 评论
searching with Extended Guard and Pivot Loop
Searching with Extended Guard and Pivot Loop
收藏 引用
2021 Prague stringology Conference, PSC 2021
作者: Pakalén, Waltteri Tarhio, Jorma Watson, Bruce W. Department of Computer Science Aalto University Finland Information Science Centre for AI Research School for Data-Science & Computational Thinking Stellenbosch University South Africa
We explore practical optimizations on comparison-based exact string matching algorithms. We present a guard test that compares q-grams between the pattern and the text before entering the match loop, and evaluate expe... 详细信息
来源: 评论
The Range Automaton: An Efficient Approach to Text-searching  1
收藏 引用
13th International Conference on Combinatorics on Words, WORDS 2021
作者: Faro, Simone Scafiti, Stefano Department of Mathematics and Computer Science University of Catania Catania Italy
string matching is one of the most extensively studied problems in computer science, mainly due to its direct applications to such diverse areas as text, image and signal processing, speech analysis and recognition, i... 详细信息
来源: 评论
Counting Lyndon Subsequences
Counting Lyndon Subsequences
收藏 引用
2021 Prague stringology Conference, PSC 2021
作者: Hirakawa, Ryo Nakashima, Yuto Inenaga, Shunsuke Takeda, Masayuki Department of Information Science and Technology Kyushu University Fukuoka Japan Department of Informatics Kyushu University Fukuoka Japan PRESTO Japan Science and Technology Agency Kawaguchi Japan
Counting substrings/subsequences that preserve some property (e.g., palindromes, squares) is an important mathematical interest in stringology. Recently, Glen et al. studied the number of Lyndon factors in a string. A... 详细信息
来源: 评论
Pattern Search Algorithm in FPGA Implementation View  44
Pattern Search Algorithm in FPGA Implementation View
收藏 引用
44th International Convention on Information, Communication and Electronic Technology, MIPRO 2021
作者: Ivosevic, D. Zagreb University of Applied Sciences Zagreb Croatia
In many fields of research pattern search problems can be viewed as a string-matching problem for which many solutions were developed over the years with varying ease of implementation and characteristics of the patte... 详细信息
来源: 评论
Pitfalls of Algorithm Comparison
Pitfalls of Algorithm Comparison
收藏 引用
2021 Prague stringology Conference, PSC 2021
作者: Pakalén, Waltteri Peltola, Hannu Tarhio, Jorma Watson, Bruce W. Department of Computer Science Aalto University Finland Information Science Centre for AI Research School for Data-Science & Computational Thinking Stellenbosch University South Africa
Why is Algorithm A faster than Algorithm B in one comparison, and vice versa in another? In this paper, we review some reasons for such differences in experimental comparisons of exact string matching algorithms. We a... 详细信息
来源: 评论
searching texts for signs of aphasia  21
Searching texts for signs of aphasia
收藏 引用
21st Conference Information Technologies - Applications and Theory, ITAT 2021
作者: Jajcayová, Tatiana Kubik, Jozef Markošová, Mária Senkovičová, Soňa Dept. of Applied Informatics Faculty of Mathematics Physics and Informatics Comenius University Bratislava Slovakia
Aphasia is a brain disorder that impairs ability to speak or understand spoken language caused by damage of the brain. It is supposed, that it might also influence the vocabulary and complexity of the written texts of... 详细信息
来源: 评论
Towards an Efficient Text Sampling Approach for Exact and Approximate Matching
Towards an Efficient Text Sampling Approach for Exact and Ap...
收藏 引用
2021 Prague stringology Conference, PSC 2021
作者: Faro, Simone Marino, Francesco Pio Pavone, Arianna Scardace, Antonio Dipartimento di Matematica e Informatica Università di Catania viale A. Doria n. 6 Catania95125 Italy Dipartimento di Scienze Cognitive Università di Messina via Concezione n.6 Messina98122 Italy
Text-sampling is an efficient approach for the string matching problem recently introduced in order to overcome the prohibitive space requirements of indexed matching, on the one hand, and drastically reduce searching... 详细信息
来源: 评论