发布求助
文献互助 智能选刊 最新文献

Annual Symposium on Combinatorial Pattern Matching最新文献

筛选
英文 中文
Ranked Document Retrieval with Forbidden Pattern 基于禁止模式的排序文档检索
Annual Symposium on Combinatorial Pattern Matching Pub Date : 2015-06-29 DOI: 10.1007/978-3-319-19929-0_7
Sudip Biswas, A. Ganguly, R. Shah, Sharma V. Thankachan
{"title":"Ranked Document Retrieval with Forbidden Pattern","authors":"Sudip Biswas, A. Ganguly, R. Shah, Sharma V. Thankachan","doi":"10.1007/978-3-319-19929-0_7","DOIUrl":"https://doi.org/10.1007/978-3-319-19929-0_7","url":null,"abstract":"","PeriodicalId":236737,"journal":{"name":"Annual Symposium on Combinatorial Pattern Matching","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124280531","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem 最小误差修正问题的定参数可跟踪性与逼近性
Annual Symposium on Combinatorial Pattern Matching Pub Date : 2015-06-29 DOI: 10.1007/978-3-319-19929-0_9
P. Bonizzoni, R. Dondi, G. Klau, Yuri Pirola, N. Pisanti, Simone Zaccaria
{"title":"On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem","authors":"P. Bonizzoni, R. Dondi, G. Klau, Yuri Pirola, N. Pisanti, Simone Zaccaria","doi":"10.1007/978-3-319-19929-0_9","DOIUrl":"https://doi.org/10.1007/978-3-319-19929-0_9","url":null,"abstract":"","PeriodicalId":236737,"journal":{"name":"Annual Symposium on Combinatorial Pattern Matching","volume":"82 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128156459","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling 关于最优顶点重标记和受限顶点重标记的硬度
Annual Symposium on Combinatorial Pattern Matching Pub Date : 2015-06-29 DOI: 10.1007/978-3-319-19929-0_1
A. Amir, Benny Porat
{"title":"On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling","authors":"A. Amir, Benny Porat","doi":"10.1007/978-3-319-19929-0_1","DOIUrl":"https://doi.org/10.1007/978-3-319-19929-0_1","url":null,"abstract":"","PeriodicalId":236737,"journal":{"name":"Annual Symposium on Combinatorial Pattern Matching","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129964004","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding LZD分解:可变到固定编码的简单实用的在线语法压缩
Annual Symposium on Combinatorial Pattern Matching Pub Date : 2015-06-29 DOI: 10.1007/978-3-319-19929-0_19
Keisuke Goto, H. Bannai, Shunsuke Inenaga, M. Takeda
{"title":"LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding","authors":"Keisuke Goto, H. Bannai, Shunsuke Inenaga, M. Takeda","doi":"10.1007/978-3-319-19929-0_19","DOIUrl":"https://doi.org/10.1007/978-3-319-19929-0_19","url":null,"abstract":"","PeriodicalId":236737,"journal":{"name":"Annual Symposium on Combinatorial Pattern Matching","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134053797","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree 短模式的半动态紧索引和简洁的van Emde Boas树
Annual Symposium on Combinatorial Pattern Matching Pub Date : 2015-06-29 DOI: 10.1007/978-3-319-19929-0_30
Yoshiaki Matsuoka, I. Tomohiro, Shunsuke Inenaga, H. Bannai, M. Takeda
{"title":"Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree","authors":"Yoshiaki Matsuoka, I. Tomohiro, Shunsuke Inenaga, H. Bannai, M. Takeda","doi":"10.1007/978-3-319-19929-0_30","DOIUrl":"https://doi.org/10.1007/978-3-319-19929-0_30","url":null,"abstract":"","PeriodicalId":236737,"journal":{"name":"Annual Symposium on Combinatorial Pattern Matching","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125965192","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis 用于泛基因组分析的压缩de Bruijn图的高效构造
Annual Symposium on Combinatorial Pattern Matching Pub Date : 2015-06-29 DOI: 10.1007/978-3-319-19929-0_4
Timo Beller, Enno Ohlebusch
{"title":"Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis","authors":"Timo Beller, Enno Ohlebusch","doi":"10.1007/978-3-319-19929-0_4","DOIUrl":"https://doi.org/10.1007/978-3-319-19929-0_4","url":null,"abstract":"","PeriodicalId":236737,"journal":{"name":"Annual Symposium on Combinatorial Pattern Matching","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129886660","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Greedy Conjecture for Strings of Length 4 长度为4的字符串的贪心猜想
Annual Symposium on Combinatorial Pattern Matching Pub Date : 2015-06-29 DOI: 10.1007/978-3-319-19929-0_26
A. Kulikov, S. Savinov, Evgeniy Sluzhaev
{"title":"Greedy Conjecture for Strings of Length 4","authors":"A. Kulikov, S. Savinov, Evgeniy Sluzhaev","doi":"10.1007/978-3-319-19929-0_26","DOIUrl":"https://doi.org/10.1007/978-3-319-19929-0_26","url":null,"abstract":"","PeriodicalId":236737,"journal":{"name":"Annual Symposium on Combinatorial Pattern Matching","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123030713","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets 最大根三联体与范三联体、禁三联体一致性的逼近性
Annual Symposium on Combinatorial Pattern Matching Pub Date : 2015-06-29 DOI: 10.1007/978-3-319-19929-0_23
J. Jansson, A. Lingas, E. Lundell
{"title":"The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets","authors":"J. Jansson, A. Lingas, E. Lundell","doi":"10.1007/978-3-319-19929-0_23","DOIUrl":"https://doi.org/10.1007/978-3-319-19929-0_23","url":null,"abstract":"","PeriodicalId":236737,"journal":{"name":"Annual Symposium on Combinatorial Pattern Matching","volume":"83 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121590641","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem 盒网格排列模式匹配问题的改进算法
Annual Symposium on Combinatorial Pattern Matching Pub Date : 2015-06-29 DOI: 10.1007/978-3-319-19929-0_12
Sukhyeun Cho, J. Na, J. Sim
{"title":"Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem","authors":"Sukhyeun Cho, J. Na, J. Sim","doi":"10.1007/978-3-319-19929-0_12","DOIUrl":"https://doi.org/10.1007/978-3-319-19929-0_12","url":null,"abstract":"","PeriodicalId":236737,"journal":{"name":"Annual Symposium on Combinatorial Pattern Matching","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126750389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm 后缀-阵列is算法约简率的概率分析
Annual Symposium on Combinatorial Pattern Matching Pub Date : 2015-06-29 DOI: 10.1007/978-3-319-19929-0_32
C. Nicaud
{"title":"A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm","authors":"C. Nicaud","doi":"10.1007/978-3-319-19929-0_32","DOIUrl":"https://doi.org/10.1007/978-3-319-19929-0_32","url":null,"abstract":"","PeriodicalId":236737,"journal":{"name":"Annual Symposium on Combinatorial Pattern Matching","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127353227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信