检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

195 篇 会议
22 篇 期刊文献

馆藏范围

217 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

213 篇 工学
- 212 篇 计算机科学与技术...
- 175 篇 软件工程
- 17 篇 生物工程
- 10 篇 电气工程
- 8 篇 电子科学与技术（可...
- 8 篇 信息与通信工程
- 7 篇 生物医学工程（可授...
- 6 篇 控制科学与工程
- 3 篇 机械工程
- 2 篇 农业工程
- 1 篇 光学工程
- 1 篇 仪器科学与技术
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 化学工程与技术
- 1 篇 林业工程
174 篇 理学
- 172 篇 数学
- 21 篇 生物学
- 6 篇 统计学（可授理学、...
- 4 篇 物理学
- 2 篇 化学
24 篇 管理学
- 19 篇 图书情报与档案管...
- 6 篇 管理科学与工程(可...
4 篇 医学
- 4 篇 临床医学
- 1 篇 基础医学(可授医学...
- 1 篇 药学(可授医学、理...
3 篇 法学
- 3 篇 社会学
2 篇 农学
- 2 篇 作物学
1 篇 教育学
- 1 篇 教育学
1 篇 文学
- 1 篇 新闻传播学

主题

217 篇 string searching...

机构

6 篇 department of bi...
5 篇 department of co...
4 篇 computer technol...
3 篇 presto japan sci...
3 篇 department of in...
3 篇 univ chile dept ...
2 篇 institute for co...
2 篇 school of inform...
2 篇 information scie...
2 篇 department of in...
2 篇 georgia inst tec...
2 篇 information scie...
2 篇 department of co...
2 篇 dipartimento di ...
2 篇 univ rouen norma...
2 篇 department of in...
2 篇 department of co...
2 篇 univ liverpool d...
2 篇 courant institut...
2 篇 department of co...

作者

11 篇 fan hongbo
7 篇 breslauer dany
7 篇 faro simone
6 篇 liu lijun
6 篇 crochemore maxim...
6 篇 huang qingsong
5 篇 tarhio jorma
5 篇 agarwal suneeta
5 篇 prasad rajesh
5 篇 lecroq thierry
4 篇 yao nianmin
4 篇 peltola hannu
4 篇 takeda masayuki
4 篇 inenaga shunsuke
4 篇 iliopoulos costa...
4 篇 navarro gonzalo
4 篇 nakashima yuto
4 篇 grossi roberto
4 篇 grabowski szymon
3 篇 manea florin

语言

211 篇 英文
4 篇 其他
2 篇 中文

检索条件"主题词=String Searching Algorithms"

共 217 条记录，以下是191-200 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Efficient string matching on coded texts 6th

Efficient string matching on coded texts

引用

6th Annual Symposium on Combinatorial Pattern Matching (CPM 95)

作者： Breslauer, D Gasieniec, L UNIV QUEBEC DEPT INFORMAT HULL PQ J8X 3X7 CANADA UNIV WARSAW INST INFORMAT PL-02097 WARSAW POLAND CNR IST ELABORAZIONE INFORMAZ I-56126 PISA ITALY

ISBN: (纸本)3540600442

The so called ''four Russians technique'' is often used to speed up algorithms by encoding several data items in a single memory cell. Given a sequence of n symbols over a constant size alphabet, one can encode the sequence into O(n/lambda) memory cells in O(log lambda) time using n/ log lambda processors. This paper presents an efficient CRCW-PRAM string-matching algorithm for coded texts that takes O(log log(m/lambda)) time(4) making only O(n/lambda) operations, an improvement by a factor of lambda = O(log n) on the number of operations used in previous algorithms. Using this string-matching algorithm one can test if a string is square-free and find all palindromes in a string in O(log log n) time using nl log log n processors.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Constant-space string matching with smaller number of comparisons: Sequential sampling 6th

Constant-space string matching with smaller number of compar...

引用

6th Annual Symposium on Combinatorial Pattern Matching (CPM 95)

作者： Gasieniec, L Plandowski, W Rytter, W Instytut Informatyki Uniwersytet Warszawsk Warszawa Poland

ISBN: (纸本)3540600442

A new string-matching algorithm working in constant space and linear time is presented. It is based on a powerful idea of sampling, originally introduced in parallel computations. The algorithm uses a sample S which consists of two positions inside the pattern P. First the positions of the sample S are tested against the corresponding positions of the text T, then a version of Knuth-Morris-Pratt algorithm is applied. This gives the simplest known string-matching algorithm which works in constant space and linear time and which does not use any linear order of the alphabet. A refined version of the algorithm gives the fastest (in the sense of number of comparisons) known algorithm for string-matching in constant space. It makes (1 + epsilon)n + O(n/m) symbol comparisons. This improves substantially the result of [3], where a (3/2 + epsilon)n comparisons constant space algorithm was designed. Additionally, our preprocessing to this algorithm makes only (1 + epsilon)m + O(1/epsilon) comparisons and uses constant space.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

New results and open problems related to non-standard stringology 6th

New results and open problems related to non-standard string...

引用

6th Annual Symposium on Combinatorial Pattern Matching (CPM 95)

作者： Muthukrishnan, S DIMACS Rutgers University United States

ISBN: (纸本)3540600442

There are a number of string matching problems for which the best known algorithms rely on algebraic convolutions (an approach pioneered by Fischer and Paterson [FP74]). These include for instance the classical string matching with wild cards and the k-mismatches problem. In [MP94], the authors studied generalizations of these problems which they called the non-standard stringology. There they derived upper and lower bounds for non-standard string matching problems. In this paper, we pose several novel problems in the area of nonstandard stringology. Some we have been able to resolve here;others we leave open. Among the technical results in this paper are: 1. improved bounds for string matching when a symbol in the string matches at most d others (motivated by noisy string matching), 2. first-known bounds for approximately counting mismatches in noisy string matching as above, and 3. improved bounds for the k-witnesses problem and its applications. Our results are obtained by using the probabilistic proof technique and randomized algorithmic methods;these techniques, although standard, have seldom been used in combinatorial pattern matching.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Approximate string matching with don’t care characters 5th

引用

5th Annual Symposium on Combinatorial Pattern Matching, CPM 1994

作者： Akutsu, Tatsuya Mechanical Engineering Laboratory 1-2 Namiki TsukubaIbaraki305 Japan

ISBN: (纸本)9783540580942

This paper presents parallel and serial approximate matching algorithms for strings with don’t care characters. They are based on Landau and Vishkin’s approximate string matching algorithm and Fisher and Paterson’s exact string matching algorithm with don’t care characters. The serial algorithm works in O(√km n log |Σ| log2 m/k) log log m/k time, and the parallel algorithm works in O(k log m) time using O(√ m/k n log |Σ| log m/k log log m/k) processors on a CRCW-PRAM, where n denotes the length of a text string, m denotes the length of a pattern string, k denotes the maximum number of differences, and Σ denotes the alphabet (i.e. the set of characters). Several extensions are also described. © Springer-Verlag Berlin Heidelberg 1994.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

string matching algorithms and automata

引用

Symposium on Results and Trends in Theoretical Computer Science in Honor of Arto Salomaa, 1994

作者： Simon, Imre Instituto de Matemática e Estatística Universidade de Sao Paulo Sao PauloSP05508-900 Brazil

In this paper we study the structure of finite automata recognizing sets of the form A*p, for some word p, and use the results obtained to improve the Knuth-Morris-Pratt string searching algorithm. We also determine t... 详细信息

ISBN: (纸本)9783540581314

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

On the exact complexity of the prefix-matching problem 2nd

引用

2nd Annual European Symposium on algorithms, ESA 1994

作者： Breslauer, Dany Colussi, Livio Toniolo, Laura BRICS - Basic Research in Computer Science - A centre of the Danish National Research Foundation Department of Computer Science University of Aarhus Aarhus CDK-8000 Denmark Dipartimento di Matematica Pura ed Applicata Università di Padova Via Belzoni 7 Padova1-35131 Italy Université de Marne-la-Vallée 2 rue de la Butte Verte Noisy-le-Grand CEDEXF-93166 France

ISBN: (纸本)9783540584346

In this paper we study the exact compar4son complexity of the string prefix-matching problem in the deterministic sequential comparison model with equality tests. We derive almost tight lower and upper bounds on the number of comparisons required in the worst case by on-line prefix-matching algorithms for any fixed pattern and variable text. Unlike previous results on the comparison complexity of stringmatching and prefix-matching algorithms, our bounds are almost tight for any particular pattern. We also consider the special case where the pattern and the text are the sarne string. This problem, which we call the string self-prefix problem, is similar to the pattern preprocessing step of the Knuth-Morris-Pratt string-matching algorithm that is used in several comparison efficient string-matching and prefix-matching algorithms, including in our new algorithm. We develop an algorithm for the self-prefix problem that requires at most 2m - é2√mù comparisons, matching the lower bound that we gave in a previous work. Our algorithms can be implemented in linear-time and space in the standard random-access-machine model. © Springer-Verlag Berlin Heidelberg 1994.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

A text compression scheme that allows fast searching directly in the compressed file 5th

引用

5th Annual Symposium on Combinatorial Pattern Matching, CPM 1994

作者： Manber, Udi Department of Computer Science University of Arizona TucsonAZ85721 United States

ISBN: (纸本)9783540580942

A new text compression scheme is presented in this paper. The main purpose of this scheme is to speed up string matching by searching the compressed file directly. The scheme requires no modification of the string-matching algorithm which is used as a black box;any string-matching procedure can be used. Instead the pattern is modified;only the outcome of the matching of the modified pattern against the compressed file is decompressed. Since the compressed file is smaller than the original file, the search is faster both in terms of I/O time and processing time than a search in the original file. For typical text files, we achieve about 30% reduction of space and slightly less of search time. A 30% space saving is not competitive with good text compression schemes, and thus should not be used where space is the predominant concern. The intended applications of this scheme are files that are searched often, such as catalogs, bibliographic files, and address books. Such files are typically not compressed, but with this scheme they can remain compressed indefinitely, saving space while allowing faster search at the same time. A particular application to an information retrieval system that we developed is also discussed. © Springer-Verlag Berlin Heidelberg 1994.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Saving comparisons in the Crochemore-Perrin string matching algorithm 1st

引用

1st Annual European Symposium on algorithms, ESA 1993

作者： Breslauer, Dany Institut National de Recherche en Informatique et en Automatique B.P. 105 Le Chesnay Cedex78153 France

ISBN: (纸本)9783540572732

Crochemore and Perrin discovered an elegant linear-time constant-space string matching algorithm that makes at most 2n - m symbol comparison. This paper shows how to modify their algorithm to use fewer comparisons. Given any fixed ∈ > 0, the new algorithm takes linear time, uses constant space and makes at most n + [1+∈/2(n - m)] symbol comparisons. If O(log m) space is available, then the algorithm makes at most n + [1/2(n - m)] symbol comparisons. The pattern preprocessing step also takes linear time and uses constant space. These are the first string matching algorithms that make fewer than 2n - m symbol comparisons and use sub-linear space. © Springer-Verlag Berlin Heidelberg 1993.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Detecting false matches in string matching algorithms 4th

引用

Conference of the European Society for Fuzzy Logic and Technology, EUSFLAT 2017 and 16th International Workshop on Intuitionistic Fuzzy Sets and Generalized Nets, IWIFSGN 2017

作者： Muthukrishnan, S. Courant Institute New York University 251 Mercer Street New YorkNY10012 United States

ISBN: (纸本)9783540567646

Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does not occur beginning at that location in the text) or a potential match (the pattern may occur beginning at that location in the text). Some of the potential matches could be false, i.e., the pattern may not occur beginning at some location in the text declared to be a potential match. We investigate the complexity of two problems in this context, namely, checking if there is any false match, and identifying all the false matches in the match vector. We present an algorithm on the CRCW PRAM that checks if there exists any false match in O(1) time using O(n) processors. Since string matching takes Ω(log log m) time on the CRCW PRAM, checking for false matches is provably simpler than string matching. As an important application, we use this simple algorithm to convert the Karp-Rabin Monte Carlo type string matching algorithm into a Las Vegas type algorithm without asymptotic loss in complexity. We also present an efficient algorithm for identifying all the false matches and as a consequence, show that string matching algorithms take Ω(log log m) time even given the flexibility to output a few false matches. In addition, we give a sequential algorithm for checking using three heads on a 2-way deterministic finite slate automaton (DFA) in linear time and another on a 1-way DFA with a fixed number of heads. © Springer-Verlag Berlin Heidelberg 1993.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Tight comparison bounds for the string prefix-matching problem 4th

引用

Conference of the European Society for Fuzzy Logic and Technology, EUSFLAT 2017 and 16th International Workshop on Intuitionistic Fuzzy Sets and Generalized Nets, IWIFSGN 2017

作者： Breslauer, Dany Colussi, Livio Toniolo, Laura Centrum voor Wiskunde en Informatica P.O. Box 4079 Amsterdam1009 AB Netherlands Universitá di Padova Dipartimento di Matematica Pura ed Applicata Via Belzoni 7 Padova35131 Italy

ISBN: (纸本)9783540567646

In the siring prefix-matching problem one is interested in finding the longest prefix of a pattern string of length m that occurs starting at each position of a text string of length n. This is a natural generalization of the string matching problem where only occurrences of the whole pattern are sought. The Knuth-Morris-Pratt string matching algorithm can be easily adapted lo solve the string prefix-matching problem without making additional comparisons. In this paper we study the exact complexity of the string prefix-matching problem in the deterministic sequential comparison model. Our bounds do not account for comparisons made in a pattern preprocessing step. The following results are presented: 1. A family of linear-time string prefix-matching algorithms that make at most └2m-1/m n┘ comparisons. 2. A tight lower bound of └2m-1/m n┘ comparisons for any string prefix-matching algorithm. We also consider the special case when the pattern and the text strings are the same string and all comparisons are accounted. This problem, which we call the string self-prefix problem, is similar lo the failure function that is computed in the pattern preprocessing of the Knuth-Morris-Pratt siring matching algorithm and used in several other comparison efficient algorithms. By using the lower bound for the string prefix-matching problem we are able to show: 3. A lower bound of 2m - ⌠2 √|comparisons for the self-prefix problem. © Springer-Verlag Berlin Heidelberg 1993.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共22页 << < 13 14 15 16 17 18 19 20 21 22 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：