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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

99 篇 期刊文献
48 篇 会议
2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

126 篇 工学
- 122 篇 计算机科学与技术...
- 30 篇 软件工程
- 8 篇 电气工程
- 4 篇 控制科学与工程
- 2 篇 信息与通信工程
- 2 篇 生物医学工程（可授...
- 1 篇 机械工程
- 1 篇 仪器科学与技术
- 1 篇 电子科学与技术（可...
- 1 篇 测绘科学与技术
- 1 篇 生物工程
- 1 篇 网络空间安全
73 篇 理学
- 70 篇 数学
- 3 篇 生物学
- 1 篇 化学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
4 篇 管理学
- 4 篇 管理科学与工程(可...
3 篇 法学
- 3 篇 法学
1 篇 农学
- 1 篇 作物学

主题

149 篇 string algorithm...
16 篇 suffix trees
15 篇 pattern matching
11 篇 combinatorial pr...
8 篇 palindromes
7 篇 longest common s...
7 篇 approximate stri...
6 篇 word-level paral...
6 篇 approximation al...
6 篇 parikh vectors
6 篇 data structures
6 篇 dynamic programm...
6 篇 edit distance
5 篇 parallel algorit...
5 篇 hamming distance
5 篇 burrows-wheeler ...
5 篇 suffix sorting
5 篇 suffix array
5 篇 combinatorics on...
4 篇 repetitions

机构

11 篇 cwi
9 篇 vrije univ
9 篇 kings coll londo...
7 篇 univ helsinki de...
7 篇 bar ilan univ de...
7 篇 kyushu univ dept...
7 篇 univ cent florid...
5 篇 univ cent florid...
4 篇 univ wisconsin d...
4 篇 louisiana state ...
4 篇 johns hopkins un...
4 篇 univ haifa cri i...
4 篇 kings coll londo...
3 篇 univ warsaw inst...
3 篇 univ eastern fin...
3 篇 bar ilan univ de...
3 篇 lodz univ techno...
3 篇 shenkar coll dep...
3 篇 univ warwick dep...
3 篇 facebook inc men...

作者

18 篇 pissis solon p.
10 篇 inenaga shunsuke
8 篇 amir amihood
7 篇 loukides grigori...
7 篇 charalampopoulos...
7 篇 bannai hideo
7 篇 thankachan sharm...
7 篇 grabowski szymon
6 篇 sweering michell...
6 篇 takeda masayuki
6 篇 giaquinta emanue...
6 篇 liptak zsuzsanna
6 篇 bernardini giuli...
6 篇 stougie leen
5 篇 fici gabriele
5 篇 ganguly arnab
5 篇 abedin paniz
5 篇 nakashima yuto
5 篇 mieno takuya
5 篇 thankachan sharm...

语言

132 篇 英文
17 篇 其他

检索条件"主题词=String algorithms"

共 149 条记录，以下是91-100 订阅

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

详细简洁

排序：

On the Optimisation of the GSACA Suffix Array Construction Algorithm 29th

On the Optimisation of the GSACA Suffix Array Construction A...

引用

29th International Symposium on string Processing and Information Retrieval (SPIRE)

作者： Olbrich, Jannik Ohlebusch, Enno Buechler, Thomas Univ Ulm D-89081 Ulm Germany

ISBN: (纸本)9783031206429;9783031206436

The suffix array is arguably one of the most important data structures in sequence analysis and consequently there is a multitude of suffix sorting algorithms. However, to this date the GSACA algorithm introduced in 2015 is the only known non-recursive linear-time suffix array construction algorithm (SACA). Despite its interesting theoretical properties, there has been little effort in improving the algorithm's sub-par real-world performance. There is a super-linear algorithm DSH which relies on the same sorting principle and is faster than DivSufSort, the fastest SACA for over a decade. This paper is concerned with analysing the sorting principle used in GSACA and DSH and exploiting its properties in order to give an optimised linear-time algorithm. Our algorithm is not only significantly faster than GSACA but also outperforms DivSufSort and DSH.

关键词： Suffix array Suffix sorting string algorithms

来源：评论

学校读者我要写书评

暂无评论

Finding the Maximum Suffix with Fewer Comparisons

Finding the Maximum Suffix with Fewer Comparisons

引用

7th International Conference on algorithms and Complexity

作者： Franceschini, Gianni Hagerup, Torben Univ Roma La Sapienza Dipartimento Informat Rome Italy Univ Augsburg Inst Informat Augsburg Germany

ISBN: (纸本)9783642130724

It is shown how to compute the lexicographically maximum suffix of a string of n >= 2 characters over a totally ordered alphabet using at most (4/3)n - 5/3 three-way character comparisons. The best previous hot id. which has stood unchallenged for more than 25 years, is (3/2)n - O(1) comparisons. We also prove an interesting property of an algorithm for computing the maximum suffix both with respect to a total order < and with respect to its inverse order >.

关键词： string algorithms maximum suffix character comparisons

来源：评论

学校读者我要写书评

暂无评论

Faster Sparse Suffix Sorting 31

Faster Sparse Suffix Sorting

引用

31st International Symposium on Theoretical Aspects of Computer Science (STACS)

作者： Tomohiro, I Karkkainen, Juha Kempa, Dominik Kyushu Univ Fukuoka Japan Univ Helsinki Helsinki Finland

ISBN: (纸本)9783939897651

The sparse suffix sorting problem is to sort b = o(n) arbitrary suffixes of a string of length n using o(n) words of space in addition to the string. We present an O(n) time Monte Carlo algorithm using O(b log b) space and an O(n log b) time Las Vegas algorithm using O(b) space. This is a significant improvement over the best prior solutions by Bille et al. (ICALP 2013): a Monte Carlo algorithm running in O(n log b) time and O(b(1+epsilon)) space or O(n log 2 b) time and O(b) space, and a Las Vegas algorithm running in O(n log(2) b + b(2) log b) time and O(b) space. All the above results are obtained with high probability not just in expectation.

关键词： string algorithms sparse suffix sorting sparse suffix trees Karp-Rabin fingerprints space-time tradeoffs

来源：评论

学校读者我要写书评

暂无评论

Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access

Finding Shuffle Words That Represent Optimal Scheduling of S...

引用

5th International Conference on Language and Automata Theory and Applications

作者： Reidenbach, Daniel Schmid, Markus L. Univ Loughborough Dept Comp Sci Loughborough LE11 3TU Leics England

ISBN: (纸本)9783642212536

In the present paper, we introduce and study the problem of computing, for any given finite set of words, a shuffle word with a minimum so-called scope coincidence degree. The scope coincidence degree is the maximum number of different symbols that parenthesise any position in the shuffle word. This problem is motivated by an application of a new automaton model and can be regarded as the problem of scheduling shared memory accesses of some parallel processes in a way that minimises the number of memory cells required. We investigate the complexity of this problem and show that it can be solved in polynomial time.

关键词： string algorithms Shuffle Memory Access Scheduling

来源：评论

学校读者我要写书评

暂无评论

A Formal Framework for stringology 19

A Formal Framework for Stringology

引用

Prague stringology Conference (PSC)

作者： Mhaskar, Neerja Soltys, Michael McMaster Univ Dept Comp & Software 1280 Main St West Hamilton ON L8S 4K1 Canada Calif State Univ Channel Isl Dept Comp Sci Camarillo CA 93012 USA

ISBN: (纸本)9788001057872

A new formal framework for stringology is proposed, which consists of a three-sorted logical theory S designed to capture the combinatorial reasoning about finite words. A witnessing theorem is proven which demonstrates how to extract algorithms for constructing strings from their proofs of existence. Various other applications of the theory are shown. The long term goal of this line of research is to introduce the tools of Proof Complexity to the analysis of strings.

关键词： proof complexity string algorithms

来源：评论

学校读者我要写书评

暂无评论

Searching for Jumbled Patterns in strings

Searching for Jumbled Patterns in Strings

引用

14th Prague stringology Conference (PSC)

作者： Cicalese, Ferdinando Fici, Gabriele Liptak, Zsuzsanna Univ Salerno Dipartimento Informat & Applicaz Salerno Italy

ISBN: (纸本)9788001044032

The Parikh vector of a string s over a finite ordered alphabet Sigma = {a1 , ...., a sigma} is defined as the vector of multiplicities of the characters, i.e. p(s) = (p(1) , ...., p(sigma)), where p(i) = vertical bar{j vertical bar s(j) = a(i)}vertical bar. Parikh vector q occurs in s if s has a substring 1 with AI) = q. The problem of searching for a query q in a text s of length ti can be solved simply and optimally with a sliding window approach in O(n) time. We present two new algorithms for the case where the text is fixed and many queries arrive over time. The first algorithm finds all occurrences of a given Parikh vector in a text (over a fixed alphaheL of size sigma >= 2) t-trid appeaN to have a uh lirii ar eXpected time COrriplexity. The second algorithm only decides whether a given Parikh vector appears in a binary text;it iteratively constructs a linear size data structure which then allows answering queries in constant time, for many queries even during the construction phase.

关键词： Parikh vectors permuted strings pattern matching string algorithms average case analysis

来源：评论

学校读者我要写书评

暂无评论

引用

1st International Conference on WEB Delivering of Music (WEDELMUSIC 2001)

作者： Barthelemy, J Bonardi, A IRCAM F-75004 Paris France

ISBN: (纸本)0769512844

In this paper, we examine a number of methods for text processing, principally coming from computational biology, and examine in which manner they can apply to musical analysis. Then, we propose a number of modifications that can be made to these methods to allow for a better application to musical analysis. To this end, we first examine the practices of musical analysis. We focus on the field of extraction of motives. A common approach to this problem is to consider repetitions : whenever some part of the musical text is repeated, it can be considered as a motive. Detecting motives can either be based on a perfect match, or on inexact matching. To this end, the concept of similarity will be introduced and analysed, and its meaning will be defined in the scope of musical analysis. We also deal with the problem of the representation (or encoding) of the musical text. The role of encoding, and its consequences on the application of algorithms will be investigated.

关键词： music analysis approximate string matching string algorithms music information retrieval music encoding data mining

来源：评论

学校读者我要写书评

暂无评论

Finding an Optimal Alphabet Ordering for Lyndon Factorization Is Hard 38

Finding an Optimal Alphabet Ordering for Lyndon Factorizatio...

引用

38th International Symposium on Theoretical Aspects of Computer Science (STACS)

作者： Gibney, Daniel Thankachan, Sharma, V Univ Cent Florida Dept Comp Sci Orlando FL 32816 USA

ISBN: (纸本)9783959771801

This work establishes several strong hardness results on the problem of finding an ordering on a string's alphabet that either minimizes or maximizes the number of factors in that string's Lyndon factorization. In doing so, we demonstrate that these ordering problems are sufficiently complex to model a wide variety of ordering constraint satisfaction problems (OCSPs). Based on this, we prove that (i) the decision versions of both the minimization and maximization problems are NP-complete, (ii) for both the minimization and maximization problems there does not exist a constant approximation algorithm running in polynomial time under the Unique Game Conjecture and (iii) there does not exist an algorithm to solve the minimization problem in time poly(vertical bar T vertical bar) . 2 degrees((sigma log sigma)) for a string T over an alphabet of size sigma under the Exponential Time Hypothesis (essentially the brute force approach of trying every alphabet order is hard to improve significantly).

关键词： Lyndon Factorization string algorithms Burrows-Wheeler Transform

来源：评论

学校读者我要写书评

暂无评论

New Advances in Rightmost Lempel-Ziv 1

引用

30th International Symposium on string Processing and Information Retrieval (SPIRE) / 18th Workshop on Compression, Text, and algorithms (WCTA)

作者： Ellert, Jonas Fischer, Johannes Pedersen, Max Rishoj Tech Univ Dortmund Dortmund Germany Tech Univ Denmark DTU Compute Lyngby Denmark

ISBN: (数字)9783031439803

ISBN: (纸本)9783031439797;9783031439803

The Lempel-Ziv (LZ) 77 factorization of a string is a widely-used algorithmic tool that plays a central role in compression and indexing. For a length-n string over a linearly-sortable alphabet, e.g., Sigma = {1, . . . , sigma} with sigma = n(O(1)), it can be computed in O(n) time. It is unknown whether this time can be achieved for the rightmost LZ parsing, where each referencing phrase points to its rightmost previous occurrence. The currently best solution takes O(n(1 + log sigma/root log n)) time (Belazzougui & Puglisi SODA2016). We show that this problem is much easier to solve for the LZ-End factorization (Kreft & Navarro DCC2010), where the rightmost factorization can be obtained in O(n) time for the greedy parsing (with phrases of maximal length), and in O(n + z root log z) time for any LZ-End parsing of z phrases. We also make advances towards a linear time solution for the general case. We show how to solve multiple non-trivial subsets of the phrases of any LZ-like parsing in O(n) time. As a prime example, we can find the rightmost occurrence of all phrases of length Omega(log(6.66) n / log(2) sigma) in O(n / log(sigma) n) time and space.

关键词： Lempel-Ziv LZ77 rightmost LZ LZ-End lossless compression string algorithms linear time algorithms word-packing

来源：评论

学校读者我要写书评

暂无评论

Handling Language Variations in Open Source Bug Reporting Systems

Handling Language Variations in Open Source Bug Reporting Sy...

引用

23rd IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)

作者： Banerjee, Sean Musgrove, Jesse Cukic, Bojan W Virginia Univ Lane Dept Comp Sci & Elect Engn Morgantown WV 26506 USA

ISBN: (纸本)9780769549286;9781467350488

Natural language plays a critical role in the design, development and maintenance of software systems. For example, bug reporting systems allow users to submit reports describing observed anomalies in free form English. However, the free form aspect makes the detection of duplicate reports a challenge due to the breadth and diversity of language used by individual reporters. Tokenization, stemming and stop word removal are commonly used techniques to normalize and reduce the language space. However, the impact of typographical errors and alternate spellings has not been analyzed in the research literature. Our research indicates that handling language problems during automated bug triage analysis can lead to a boost in performance. We show that the language used in software problem reporting is too specialized to benefit from domain independent spell checkers or lexical databases. Therefore, we present a novel approach using word distance and neighbor word likelihood measures for detecting and resolving language-based issues in open-source software problem reporting. We evaluate our approach using the complete Firefox repository until March 2012. Our results indicate measurable improvements in duplicate detection results, while reducing the language space for most frequently used words by 30%. Moreover, our method is language-agnostic and does not require a pre-built dictionary, thus making it suitable for use in a variety of systems.

关键词： Typographical Errors Alternate Spellings Duplicate Bug Reports string algorithms Software Maintenance Software Reliability

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共15页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：