字符串算法书籍

发布于 2024-09-01 03:23:52 字数 482 浏览 4 评论 0原文

关于字符串算法的帖子有很多:

但是一般文献中没有提及。

有人可以推荐一本可以彻底探索各种字符串算法的书吗? 特别感兴趣的主题是近似字符串匹配[诸如谷歌提供的校正搜索字符串变体之类的东西:)]。

非常感谢您的建议。

There have been numerous posts on string algorithms:

However, no general literature was mentioned.

Could anyone recommend a book(s) that would thoroughly explore various string algorithms?
The topic which is of special interest is approximate string matching [things like google-offered corrected search string variants :) ].

Thanks a lot for advice.

如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。

扫码二维码加入Web技术交流群

发布评论

需要 登录 才能够评论, 你可以免费 注册 一个本站的账号。

评论(5

与之呼应 2024-09-08 03:23:52

我很惊讶没有人提到 Dan Gusfield 的优秀著作字符串、树和序列的算法< /a> 其中涵盖了比任何人可能需要的更详细的字符串算法。它对我几年前从事的蛋白质测序项目非常有用。读完本书后,您将学到:

  • 基于朴素字符串匹配
  • 预处理器的算法(Boyer Moore、Knuth-Morris-Pratt)
  • 正则表达式匹配算法
  • Karp-Rabin 和类似方法
  • 后缀树方法(Ukkonen 方法等)
  • 序列对齐(Levenshtein 距离和字符串相似度)和多序列比对)
  • 应用于DNA测序、基因预测等领域。

I'm surprised no-one has mentioned Dan Gusfield's excellent book Algorithms on Strings, Trees and Sequences which covers string algorithms in more detail than anyone would probably need. It served me very well for a project on protein sequencing that I was working on a few years ago. After reading this book you will learn:

  • Naive String Matching
  • Preprocessor Based algorithms (Boyer Moore, Knuth-Morris-Pratt)
  • Regex matching algorithms
  • Karp-Rabin and similar methods
  • Suffix tree methods (Ukkonen's method, etc)
  • Sequence alignment (Levenshtein distance and string similarity, and multiple sequence alignment)
  • Applications to DNA sequencing, gene prediction and other areas.
沒落の蓅哖 2024-09-08 03:23:52

这不是书籍推荐,但这个库和网站是一个提供大量高效字符串匹配算法实现的库:

http://www.dcs.shef.ac.uk/~sam/simmetrics.html

它还提供了进一步学习每个内容以及每个内容最适用的链接。

This is not a book recommendation, but this library and site is a library that offers plenty of efficient string matching algorithm implementations:

http://www.dcs.shef.ac.uk/~sam/simmetrics.html

It also provides links to further learning for each and where each is best applicable.

幸福还没到 2024-09-08 03:23:52

CLR 有一些字符串处理算法,但并不是特定于它们的。

包括:

  • Knuth-Morris-Pratt
  • < a href="http://en.wikipedia.org/wiki/Rabin%E2%80%93Karp_string_search_algorithm" rel="nofollow noreferrer">Rabin-Karp
  • 通过有限自动机
  • 编辑距离匹配

CLR has some string processing algorithms, but it's not specific to them.

Including:

第几種人 2024-09-08 03:23:52

TRE 是一个实现近似匹配的开源库。 关于页面有一些关于它如何工作的有趣提示,尽管我不确定它是否提供了您正在寻找的某种深入分析。从这个角度来看,源代码可能更具启发性。

TRE is an open-source library that implements approximate matching. The About page has some interesting hints about how it works, although I'm not sure it provides the sort of in-depth analysis you're looking for. The source code is probably more enlightening from that perspective.

~没有更多了~
我们使用 Cookies 和其他技术来定制您的体验包括您的登录状态等。通过阅读我们的 隐私政策 了解更多相关信息。 单击 接受 或继续使用网站,即表示您同意使用 Cookies 和您的相关数据。
原文