搜索资源列表
实验7 二叉树 北京师范大学数学科学院
- 自创的算法，输入表达式，建立二叉树的程序，然后输出前缀中缀后缀表示法，利用的对表达式的分割与递归实现输入，同时这也是一个完整的波兰式转换程序，相当稳健-own algorithm, the importation of expression, the establishment of the binary tree and then output the suffix prefix which is made up of the method, using the right expressio
消除左递归得到后缀式
- 解法:对原文法消除左递归,根据消除左递归后的等价文法建立语法树,而后对此语法树 进行后根遍历,即可得到后缀式.- Solution: Eliminates the left recursion to the original grammar, after equal in value grammar establishment grammar tree which eliminates the left recursion, after but the grammar tree carrie
main
- 后缀树构造软件
libsfxdisk-1[1].2.tar
- 后缀数存储算法，利用后缀树(sufixtree)存储，搜索数据，可以达到C*O(n)的复杂度-suffix several storage algorithm, the use of the suffix tree (sufixtree) storage, search, which can reach C * O (n) the complexity
suffix
- 倍增算法实现后缀数组，在字符串处理当中，后缀树和后缀数组都是非常有力的工具，其中后缀树大家了解得比较多，关于后缀数组则很少见于国内的资料。-suffix array
suffix_tree
- 后缀树的算法实现。基本定义在suffixtree.h中，具体实现参见suffixtree.c.-Suffix tree algorithm. Basic definitions in suffixtree.h, the concrete realization see suffixtree.c.
houzhui_tree
- 本代码是对后缀树进行构建，然后对构建的后缀树进行一些简单操作，运用后缀树计算最长子序列-create the tiretree ,then calculate the longest common squenece of two string by using tiretree
SuffixTree
- 重要算法后缀树的实现，非常实用-Important algorithm for the realization of the suffix tree
10253
- 本代码是在KMP算法上加以改进后，实现对一个字串求最长重复子序列。该算法可以与后缀树有相同原理。-The code is in the KMP algorithm be improved to realize for the longest string of a repeat sequence. The suffix tree algorithm with the same principle.
Linear_Suffix_Array_Construction
- 另外一篇后缀数组的算法论文，非常高效，而且附上了详细的证明。显示出与后缀树的优势-Suffix Array
tree
- 算术表达式与二叉树之间存在着对应关系，编写把以前缀形式输入的合法算术表达式转换为中缀表达式，再转换为后缀表达式，并求表达式的值-Arithmetic expressions with binary tree there is a correlation between the preparation of the form to enter the legitimate prefix arithmetic expression conversion infix expression, and t
suffix_Tree
- 后缀树构造程序，输入字符串，产生该字符串的后缀树结构-Suffix tree construction process, input string, resulting in the string suffix tree structure
gsuffix-1.0.0.tar
- 该gsuffix库实现枚举的字符串搜索使用 serveral的算法。它采用了后缀树和后缀数组的数据结构，以及一些其他方法。-The gsuffix library implements serveral algorithms used for enumerative string searches. It incorporates the suffix tree and suffix array data structures as well as some other methods.
suffix_Tree
- 后缀树，经典的用后缀树建立索引，搞搜索的同学可以-suff_tree，which is a good method by a forigner in the field of searching
st
- 我自己写的关于后缀树的实现，可以参考。 implementation of suffix tree, just for reference.
suffixtree
- 后缀树的代码，比较长，不是我写的，别人给的学习用的。-Suffix tree code, the longer, not mine, and others use to learn.
string
- 字符串匹配算法研究 字符串匹配 前缀 后缀 kmp算法 后缀树-with internet booming, the amount of information gets more and more. How to find the target information in such tramendous data is the key in web searching develepment. In this end the string matching algorithm takes
StringCon
- 字符串的比对函数。字符串的比对应用了后缀树的比对是数据库的重要应用。-String comparison functions. Strings than on the application of the suffix tree alignment is an important application of the database.
houzhuishu
- 内有后缀树源码及相关说明文档ppt，算法较完整，经过试验，可以运行，希望对你有帮助-Source within the suffix tree and related documentation ppt, more complete method, after testing, you can run, I hope to help you
SaxShuffixTree
- SAX和后缀树的连接，将double转为字符，然后用后缀树建立连接-suffix tree