【24h】

Searching for a Set of Correlated Patterns

机译:搜索一组相关模式

获取原文
获取原文并翻译 | 示例

摘要

We concentrate in this paper on multiple pattern matching, in which a set of patterns S = {P_1, ... , P_k}, rather than a single one, is to be located in a given text T. This problem has been treated in several works, including Aho and Corasick, Commentz-Walter, Uratani and Takeda and Crochemore et al. None of these algorithms assumes any relationships between the individual patterns. Nevertheless, there are many situations where the given strings are not necessarily independent.
机译:在本文中,我们将重点放在多个模式匹配上,其中在给定的文本T中应放置一组模式S = {P_1,...,P_k},而不是单个模式。一些作品,包括Aho和Corasick,Commentz-Walter,Uratani和Takeda和Crochemore等。这些算法均未假设各个模式之间的任何关系。但是,在许多情况下,给定的字符串不一定是独立的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号