找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorial Pattern Matching; 8th Annual Symposium Alberto Apostolico,Jotun Hein Conference proceedings 1997 Springer-Verlag Berlin Heide

[复制链接]
查看: 47792|回复: 63
发表于 2025-3-21 19:13:30 | 显示全部楼层 |阅读模式
书目名称Combinatorial Pattern Matching
副标题8th Annual Symposium
编辑Alberto Apostolico,Jotun Hein
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Combinatorial Pattern Matching; 8th Annual Symposium Alberto Apostolico,Jotun Hein Conference proceedings 1997 Springer-Verlag Berlin Heide
描述This book constitutes the refereed proceedings of the Eighth Annual Symposium on Combinatorial Pattern Matching, CPM 97, held in Aarhus, Denmark, in June/July 1997..The volume presents 20 revised full papers carefully selected from 32 submissions received; also included are abstracts of two invited contributions. The volume is devoted to the issue of searching and matching strings and more complicated patterns, such as trees, regular expressions, graphs, point sets and arrays. The results presented are particularly relevant to molecular biology, but also to information retrieval, pattern recognition, compiling, data compression and program analysis.
出版日期Conference proceedings 1997
关键词combinatorial structures; data compression; information retrieval; molecular biology; pattern matching; p
版次1
doihttps://doi.org/10.1007/3-540-63220-4
isbn_softcover978-3-540-63220-7
isbn_ebook978-3-540-69214-0Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 1997
The information of publication is updating

书目名称Combinatorial Pattern Matching影响因子(影响力)




书目名称Combinatorial Pattern Matching影响因子(影响力)学科排名




书目名称Combinatorial Pattern Matching网络公开度




书目名称Combinatorial Pattern Matching网络公开度学科排名




书目名称Combinatorial Pattern Matching被引频次




书目名称Combinatorial Pattern Matching被引频次学科排名




书目名称Combinatorial Pattern Matching年度引用




书目名称Combinatorial Pattern Matching年度引用学科排名




书目名称Combinatorial Pattern Matching读者反馈




书目名称Combinatorial Pattern Matching读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:38:50 | 显示全部楼层
Episode matching,ntain episode . as a subsequence. The respective optimization problem is to find the smallest number ., s.t. text . has a subword of length . which contains episode ...In this paper, we introduce a few efficient off-line as well as on-line algorithms for the entire problem, where by on-line algorith
发表于 2025-3-22 00:45:15 | 显示全部楼层
发表于 2025-3-22 05:24:19 | 显示全部楼层
On the complexity of pattern matching for highly compressed two-dimensional texts,ub-texts are defined in terms of smaller parts in a way similar to that of Lempel-Ziv compression for 1-dimensional texts, or in shortly described strings as in [9], or in hierarchical graphs described by context-free graph grammars. A given 2d-text . with many internal repetitions can have a hierar
发表于 2025-3-22 09:33:10 | 显示全部楼层
发表于 2025-3-22 16:54:40 | 显示全部楼层
发表于 2025-3-22 18:14:29 | 显示全部楼层
External inverse pattern matching,oal is to find a pattern . ∈ .. which is not a subword of . and which maximizes the sum of Hamming distances between . and all subwords of . of length .. We present an optimal . log σ)-time (where σ=∣Σ∣) algorithm for the external inverse pattern matching problem. This substantially improves the . l
发表于 2025-3-22 22:03:22 | 显示全部楼层
发表于 2025-3-23 04:49:05 | 显示全部楼层
A filter method for the weighted local similarity search problem,. of a pattern and subwords of a text whose lengths exceed a certain threshold. Moreover, arbitrary gap and substitution weights are allowed. In this paper, two new prefilter algorithms for the weighted local similarity search problem are presented. These overcome the disadvantages of a similar filt
发表于 2025-3-23 05:46:40 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-6 14:13
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表