咨询与建议

限定检索结果

文献类型

  • 2 篇 会议
  • 1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 2 篇 理学
    • 2 篇 数学
  • 2 篇 工学
    • 2 篇 计算机科学与技术...

主题

  • 3 篇 horspool algorit...
  • 1 篇 kmp algorithm
  • 1 篇 experimental com...
  • 1 篇 analysis of algo...
  • 1 篇 permuted pattern...
  • 1 篇 string matching
  • 1 篇 order-preserving...
  • 1 篇 boyer-moore algo...
  • 1 篇 order-isomorphis...
  • 1 篇 multi-track stri...
  • 1 篇 ac-automaton

机构

  • 1 篇 inha univ dept c...
  • 1 篇 tohoku univ grad...
  • 1 篇 helsinki univ te...
  • 1 篇 sejong univ dept...
  • 1 篇 seoul natl univ ...

作者

  • 1 篇 sim jeong seop
  • 1 篇 tarhio jorma
  • 1 篇 yoshinaka ryo
  • 1 篇 shinohara ayumi
  • 1 篇 peltola hamm
  • 1 篇 park kunsoo
  • 1 篇 na joong chae
  • 1 篇 diptarama
  • 1 篇 cho sukhyeun

语言

  • 3 篇 英文
检索条件"主题词=Horspool algorithm"
3 条 记 录,以下是1-10 订阅
排序:
A fast algorithm for order-preserving pattern matching
收藏 引用
INFORMATION PROCESSING LETTERS 2015年 第2期115卷 397-402页
作者: Cho, Sukhyeun Na, Joong Chae Park, Kunsoo Sim, Jeong Seop Inha Univ Dept Comp & Informat Engn Inchon 402751 South Korea Sejong Univ Dept Comp Sci & Engn Seoul 143747 South Korea Seoul Natl Univ Sch Comp Sci & Engn Seoul 151742 South Korea
Given a text T and a pattern P, the order-preserving pattern matching (OPPM) problem is to find all substrings in T which have the same relative orders as P. The OPPM has been studied in the fields of finding some pat... 详细信息
来源: 评论
Fast Full Permuted Pattern Matching algorithms on Multi-track Strings  20
Fast Full Permuted Pattern Matching Algorithms on Multi-trac...
收藏 引用
Prague Stringology Conference (PSC)
作者: Diptarama Yoshinaka, Ryo Shinohara, Ayumi Tohoku Univ Grad Sch Informat Sci Aoba Ku 6-6-05 Aramaki Aza Aoba Sendai Miyagi Japan
A multi-track string is a tuple of strings of the same length. The full permuted pattern matching problem is, given two multi-track strings T = (t(1), t(2),..., t(N)) and P = (p(1), p(2),..., p(N)) such that vertical ... 详细信息
来源: 评论
On string matching in chunked texts
On string matching in chunked texts
收藏 引用
12th International Conference on Implementation and Application of Automata
作者: Peltola, Hamm Tarhio, Jorma Helsinki Univ Technol Dept Comp Sci & Engn FI-02015 Helsinki Finland
We study exact string matching in special texts, which consist of consecutive fixed-length chunks where each position of a chunk has a character distribution of its own. This kind of setting can also be interpreted so... 详细信息
来源: 评论