v

您的位置:VeryCD图书计算机与网络

图书资源事务区


《字串学珠玑》(Jewels of Stringology)扫描版[DJVU]

  • 状态: 精华资源
  • 摘要:
    出版社World Scientific Publishing Company
    发行时间2003年
    语言英文
  • 时间: 2010/06/02 11:04:12 发布 | 2011/05/13 18:38:04 更新
  • 分类: 图书  计算机与网络 

Jean_Pierre

精华资源: 37

全部资源: 37

相关: 分享到新浪微博   转播到腾讯微博   分享到开心网   分享到人人   分享到QQ空间   订阅本资源RSS更新   美味书签  subtitle
该内容尚未提供权利证明,无法提供下载。
中文名字串学珠玑
原名Jewels of Stringology
资源格式DJVU
版本扫描版
出版社World Scientific Publishing Company
书号9810248970
发行时间2003年
地区美国
语言英文
简介

IPB Image

内容简介

The term "stringology" is a popular nickname for text algorithms, or algorithms on strings. This work deals with the most basic algorithms in the area. Most of them can be viewed as "algorithmic jewels" and deserve reader-friendly presentation. One of the main aims of the book is to present several of the most celebrated algorithms in a simple way by omitting obscuring details and separating algorithmic structure from combinatorial theoretical background. The text reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. The text can be viewed as a parade of algorithms in which the main purpose is to discuss the foundations of the algorithms and their interconnections. One can partition algorithmic problems discussed into practical and theoretical problems. Certainly, string matching and data compression are in the former class, while most problems related to symmetries and repetitions in texts are in the latter. However, all the problems are interesting from an algorithmic point of view and enable the reader to appreciate the importance of combinatorics on words as a tool in the design of efficient text algorithms. In most textbooks on algorithms and data structures, the presentation of efficient algorithms on words is quite short as compared to issues in graph theory, sorting, searching, and some other areas. At the same time, there are many presentations of interesting algorithms on words accessible only in journals and in a form directed mainly at specialists.

Review:

… nicely covers material from the famous KMP and BM algorithms to suffix trees … -- Mathematical Reviews --This text refers to the Hardcover edition.

内容截图

IPB Image



目录

1. Stringology
2. Basic String Searching Algorithms
3. Preprocessing for Basic Searchings
4. On-Line Construction of Suffix Trees
5. More on Suffix Trees
6. Subword Graphs
7. Text Algorithms Related to Sorting
8. Symmetries and Repetitions in Texts
9. Constant-Space Searchings
10. Text Compression Techniques
11. Automata-Theoretic Approach
12. Approximate Pattern Matching
13. Matching by Dueling and Sampling
14. Two-Dimensional Pattern Matching
15. Two-Dimensional Periodicities
16. Parallel Text Algorithms
17. Miscellaneous

正在读取……

这里是其它用户补充的资源(我也要补充):

暂无补充资源
正在加载,请稍等...

点击查看所有32网友评论

 

(?) [公告]留口水、评论相关规则 | [活动]每日签到 轻松领取电驴经验

    小贴士:
  1. 类似“顶”、“沙发”之类没有营养的文字,对勤劳贡献的楼主来说是令人沮丧的反馈信息。
  2. 提问之前请再仔细看一遍楼主的说明,或许是您遗漏了。
  3. 勿催片。请相信驴友们对分享是富有激情的,如果确有更新版本,您一定能搜索到。
  4. 请勿到处挖坑绊人、招贴广告。既占空间让人厌烦,又没人会搭理,于人于己都无利。
  5. 如果您发现自己的评论不见了,请参考以上4条。