…看到 ATP 合成酶运转的视频 [1]。我知道这类东西跟计算生物学实际干的事关系不大，但确实极其激发想象力。我正在啃 Dan Gusfield 写的《Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology》[2]，目前遇到的所有算法我都（带着测试）实现了一遍，还做了一些习题 [3]。到目前为止，我真觉得…
…seeing a video of ATP synthase in action [1]. Now, I know stuff like that doesn't have a lot to do with what is done in computational biology, but it did fire the imagination. I'm working my way through Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology by Dan Gusfield [2], and have implemented (with tests) all of the algorithms encountered thus far in addition to some of the exercises [3]. So far, I really…
这看起来不过是对 suffix tree 已有算法的重复造轮子。我推荐（之前也在原文评论里推荐过）Dan Gusfield 的书《Algorithms on Strings, Trees, and Sequences》，它对相关算法和数据结构的讲解非常全面深入。
This appears to be just reinvention of known algorithms on suffix trees. I recommend (and recommended as a comment on the original article) Dan Gusfield's book "Algorithms on Strings, Trees, and Sequences" which does a pretty thorough job of covering the relevant algorithms and data structures.
我没读过那本教材，但另一本很棒的书是 Dan Gusfield 的《Algorithms on Strings, Trees, and Sequences》（http://www.amazon.ca/Algorithms-Strings-Trees-Sequences-Comp...）。它偏向生物信息学，所以你能学到各种算法在接近真实世界的有趣应用。…
I've not read that textbook, but another excellent text is "Algorithms on Strings, Trees, and Sequences" by Dan Gusfield (http://www.amazon.ca/Algorithms-Strings-Trees-Sequences-Comp...). It has a strong bioinformatics leaning, so you learn all sorts of interesting near-real-world applications for the algorithms.…
…按“容易程度”降序排列）- Python Algorithms - The Algorithm Design Manual - CLRS - Algorithms in Java（不知为何我觉得 CLRS 比这本更好懂）- 然后我最近发现了这本，《Algorithms on Strings,Trees and Sequences: Computer Science and Computational Biology》（在啃这本之前最好至少把前两本过一遍，读起来会轻松点）免责声明：我…
…decreasing order of "easiness") - Python Algorithms - The Algorithm Design Manual - CLRS - Algorithms in Java (somehow I found CLRS easier to follow than this) - And then I found this recently, "Algorithms on Strings,Trees and Sequences: Computer Science and Computational Biology" (one should have at least gone through the first two recommendations before starting with this one to make it easier to read this one) Disclaimer : I have…
Dan Gusfield 在 1997 年写了本书叫《Algorithms on strings, trees and sequences: Computer Science and Computational Biology》。我们（当时是马里兰大学语言高级研究中心）发现里面介绍的一些技术在（自然）…
Dan Gusfield wrote a book in 1997 entitled "Algorithms on strings, trees and sequences: Computer Science and Computational Biology". We (what was then the Center for Advanced Study of Language at the University of Maryland) found some of the techniques described there to be useful in (natural)…
…/模式串的/长度——即 O(p)。suffix tree 以压缩方式存储字符串的所有后缀（即具有线性空间开销，根据 Gusfield, D. (1997)《Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology》给出的估算大约是 O(20n)），所以你只需从根节点沿着一条序列遍历到内部节点或叶节点，就能在其中搜索一个词…
…length /of the pattern/ - i.e. O(p). The suffix tree stores all suffixes of a string in a compressed manner (i.e. it has a linear space overhead, approximately O(20n) as given by Gusfield, D. (1997). Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press), so you can search for a word in it by simply traversing from the root node to an internal or leaf node by following a sequence…
…看到 ATP 合成酶运转的视频 [1]。我知道这类东西跟计算生物学实际干的事关系不大，但确实极其激发想象力。我正在啃 Dan Gusfield 写的《Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology》[2]，目前遇到的所有算法我都（带着测试）实现了一遍，还做了一些习题 [3]。到目前为止，我真觉得…
…seeing a video of ATP synthase in action [1]. Now, I know stuff like that doesn't have a lot to do with what is done in computational biology, but it did fire the imagination. I'm working my way through Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology by Dan Gusfield [2], and have implemented (with tests) all of the algorithms encountered thus far in addition to some of the exercises [3]. So far, I really…
这看起来不过是对 suffix tree 已有算法的重复造轮子。我推荐（之前也在原文评论里推荐过）Dan Gusfield 的书《Algorithms on Strings, Trees, and Sequences》，它对相关算法和数据结构的讲解非常全面深入。
This appears to be just reinvention of known algorithms on suffix trees. I recommend (and recommended as a comment on the original article) Dan Gusfield's book "Algorithms on Strings, Trees, and Sequences" which does a pretty thorough job of covering the relevant algorithms and data structures.
我没读过那本教材，但另一本很棒的书是 Dan Gusfield 的《Algorithms on Strings, Trees, and Sequences》（http://www.amazon.ca/Algorithms-Strings-Trees-Sequences-Comp...）。它偏向生物信息学，所以你能学到各种算法在接近真实世界的有趣应用。…
I've not read that textbook, but another excellent text is "Algorithms on Strings, Trees, and Sequences" by Dan Gusfield (http://www.amazon.ca/Algorithms-Strings-Trees-Sequences-Comp...). It has a strong bioinformatics leaning, so you learn all sorts of interesting near-real-world applications for the algorithms.…
…按“容易程度”降序排列）- Python Algorithms - The Algorithm Design Manual - CLRS - Algorithms in Java（不知为何我觉得 CLRS 比这本更好懂）- 然后我最近发现了这本，《Algorithms on Strings,Trees and Sequences: Computer Science and Computational Biology》（在啃这本之前最好至少把前两本过一遍，读起来会轻松点）免责声明：我…
…decreasing order of "easiness") - Python Algorithms - The Algorithm Design Manual - CLRS - Algorithms in Java (somehow I found CLRS easier to follow than this) - And then I found this recently, "Algorithms on Strings,Trees and Sequences: Computer Science and Computational Biology" (one should have at least gone through the first two recommendations before starting with this one to make it easier to read this one) Disclaimer : I have…
Dan Gusfield 在 1997 年写了本书叫《Algorithms on strings, trees and sequences: Computer Science and Computational Biology》。我们（当时是马里兰大学语言高级研究中心）发现里面介绍的一些技术在（自然）…
Dan Gusfield wrote a book in 1997 entitled "Algorithms on strings, trees and sequences: Computer Science and Computational Biology". We (what was then the Center for Advanced Study of Language at the University of Maryland) found some of the techniques described there to be useful in (natural)…
…/模式串的/长度——即 O(p)。suffix tree 以压缩方式存储字符串的所有后缀（即具有线性空间开销，根据 Gusfield, D. (1997)《Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology》给出的估算大约是 O(20n)），所以你只需从根节点沿着一条序列遍历到内部节点或叶节点，就能在其中搜索一个词…
…length /of the pattern/ - i.e. O(p). The suffix tree stores all suffixes of a string in a compressed manner (i.e. it has a linear space overhead, approximately O(20n) as given by Gusfield, D. (1997). Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press), so you can search for a word in it by simply traversing from the root node to an internal or leaf node by following a sequence…