找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorial Pattern Matching; 24th Annual Symposiu Johannes Fischer,Peter Sanders Conference proceedings 2013 Springer-Verlag Berlin Heid

[复制链接]
查看: 44425|回复: 51
发表于 2025-3-21 16:30:28 | 显示全部楼层 |阅读模式
书目名称Combinatorial Pattern Matching
副标题24th Annual Symposiu
编辑Johannes Fischer,Peter Sanders
视频video
概述Up-to-date results.Fast track conference proceedings.State-of-the-art report
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Combinatorial Pattern Matching; 24th Annual Symposiu Johannes Fischer,Peter Sanders Conference proceedings 2013 Springer-Verlag Berlin Heid
描述This book constitutes the refereed proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013, held in Bad Herrenalb (near Karlsruhe), Germany, in June 2013. The 21 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 51 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problem or pinpoint conditions under which searches cannot be performed efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing, and pattern recognition.
出版日期Conference proceedings 2013
关键词NP-Completeness; bit-parallelism; external memory algorithms; grammar-based compression; text indexes; al
版次1
doihttps://doi.org/10.1007/978-3-642-38905-4
isbn_softcover978-3-642-38904-7
isbn_ebook978-3-642-38905-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2013
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 人参与投票
 

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:25:47 | 显示全部楼层
发表于 2025-3-22 01:30:44 | 显示全部楼层
Combinatorial Pattern Matching978-3-642-38905-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-22 05:56:42 | 显示全部楼层
发表于 2025-3-22 11:45:27 | 显示全部楼层
发表于 2025-3-22 16:10:51 | 显示全部楼层
发表于 2025-3-22 17:05:50 | 显示全部楼层
Jerzy J. Korczak,Ilona Pawełoszekinuous mathematics. As a discrete mathematician recently entering this domain in the context of analyzing biological images, primarily from various forms of microscopy, I have found that discrete techniques involving trees and graphs better solve some segmentation and tracking problems than their co
发表于 2025-3-23 01:08:41 | 显示全部楼层
Smart Innovation, Systems and Technologiesin strings is an important problem and therefore a well studied one in the strings community. For a given string . of length ., finding all maximal exact runs in the string can be done in .(. log.) time or .(.) time on integer alphabets. In this paper, we investigate the maximal approximate runs pro
发表于 2025-3-23 05:23:02 | 显示全部楼层
Smart Education and e-Learning 2016raphically minimal and maximal suffixes of a given string . can be computed in linear time and space by constructing a suffix tree or a suffix array of .. Here we consider the case when . is a substring of another string . of length .. We propose two linear-space data structures for . which allow to
发表于 2025-3-23 07:33:50 | 显示全部楼层
University Smart Guidance Counsellingch conversion in . time, where . is the number of LZ78 codewords. This improves on the previously known . solution [Bannai et al., SPIRE 2012]. The main tool in our algorithm is a data structure which allows us to efficiently operate on labels of the paths in a growing trie, and a certain method of
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-25 11:25
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表