咨询与建议

限定检索结果

文献类型

  • 9 篇 期刊文献
  • 2 篇 会议
  • 1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 7 篇 理学
    • 7 篇 数学
  • 5 篇 工学
    • 5 篇 计算机科学与技术...
    • 1 篇 软件工程

主题

  • 12 篇 text algorithms
  • 4 篇 abelian period
  • 4 篇 combinatorics on...
  • 3 篇 design of algori...
  • 3 篇 weak repetition
  • 2 篇 indexing
  • 2 篇 pattern matching
  • 2 篇 abelian repetiti...
  • 1 篇 naming
  • 1 篇 covers
  • 1 篇 self-indexes
  • 1 篇 image algorithms
  • 1 篇 stringology
  • 1 篇 three-way merge
  • 1 篇 online searching
  • 1 篇 combinatorics on
  • 1 篇 bit-parallelism
  • 1 篇 exact string mat...
  • 1 篇 fingerprint
  • 1 篇 set of colors

机构

  • 2 篇 univ palermo dip...
  • 1 篇 i3s cnrs and uni...
  • 1 篇 univ rouen norma...
  • 1 篇 univ warsaw inst...
  • 1 篇 res ctr sci & te...
  • 1 篇 xerox res ctr eu...
  • 1 篇 cwi
  • 1 篇 istanbul medipol...
  • 1 篇 mcmaster univ de...
  • 1 篇 murdoch univ fac...
  • 1 篇 lomonosov moscow...
  • 1 篇 univ rouen norma...
  • 1 篇 vrije univ
  • 1 篇 univ catania dip...
  • 1 篇 amazon com on
  • 1 篇 lomonosov moscow...
  • 1 篇 univ rouen norma...
  • 1 篇 charles universi...
  • 1 篇 univ eastern fin...
  • 1 篇 univ warsaw fac ...

作者

  • 4 篇 fici gabriele
  • 4 篇 lefebvre arnaud
  • 4 篇 lecroq thierry
  • 3 篇 prieur-gaston el...
  • 2 篇 raffinot mathieu
  • 2 篇 smyth william f.
  • 2 篇 belazzougui djam...
  • 2 篇 kolpakov roman
  • 1 篇 karhu kalle
  • 1 篇 radoszewski jaku...
  • 1 篇 susik robert
  • 1 篇 charalampopoulos...
  • 1 篇 kociumaka tomasz
  • 1 篇 antoniewicz arka...
  • 1 篇 prieur-gaston él...
  • 1 篇 zuba wiktor
  • 1 篇 pissis solon p.
  • 1 篇 kulekci m. oguzh...
  • 1 篇 walen tomasz
  • 1 篇 tealdi matias

语言

  • 7 篇 英文
  • 5 篇 其他
检索条件"主题词=Text algorithms"
12 条 记 录,以下是11-20 订阅
排序:
REVISITING MULTIPLE PATTERN MATCHING
收藏 引用
COMPUTING AND INFORMATICS 2019年 第4期38卷 937-962页
作者: Susik, Robert Grabowski, Szymon Fredriksson, Kimmo Lodz Univ Technol Inst Appl Comp Sci Al Politech 11 PL-90924 Lodz Poland Univ Eastern Finland Sch Comp POB 16-27 FI-70211 Kuopio Finland
We consider the classical exact multiple string matching problem. The proposed solution is based on a combination of a few ideas: using q-grams instead of single characters, pattern superimposition, bit-parallelism an... 详细信息
来源: 评论
Fast and flexible packed string matching
收藏 引用
JOURNAL OF DISCRETE algorithms 2014年 第0期28卷 61-72页
作者: Faro, Simone Kulekci, M. Oguzhan Univ Catania Dipartimento Matemat & Informat Catania Italy Istanbul Medipol Univ Fac Engn & Nat Sci Istanbul Turkey
Searching for all occurrences of a pattern in a text is a fundamental problem in computer science with applications in many other fields, like natural language processing, information retrieval and computational biolo... 详细信息
来源: 评论