Location:
Search - suffix array a
Search list
Description: 后缀数组的构造，实现了对字符串的子串的匹配及最长重复子串的查找-Suffix array construction, the realization of a substring of string matching and longest repeat substring search
Platform: |
Size: 6144 |
Author: 顾亚楠 |
Hits:
Description: 后缀数组的资料在国内还是少有的，是种很高效数据结构，用来求LCS很方便-Suffix array of information at home or rare, is a very efficient data structure, used for easy LCS
Platform: |
Size: 2048 |
Author: sinamaster |
Hits:
Description: 这是一个后缀数组实现的源代码，在vc6.0、gcc等编译通过。后缀数组是一种高级数据结构，用后最数组查找重复字串时间复杂度是o（nlogn）-This is a suffix array realize the source code, in vc6.0, gcc compiler, etc. through. Suffix array is an advanced data structure, with most repeat string array search time complexity is o (nlogn)
Platform: |
Size: 1024 |
Author: 孟繁荣 |
Hits:
Description: acm竞赛代码资料 构造后缀数据程序及其几个应用-acm contest code suffix data process data structure and its several applications
Platform: |
Size: 2048 |
Author: liulanzheng |
Hits:
Description: c++ 计算器 支持小数括号 运算 可出后缀排列-c++ calculator support brackets decimal computing can be a suffix array
Platform: |
Size: 3072 |
Author: 9 |
Hits:
Description: spoj705 后缀数组 里面有后缀数组的模板 在spoj上提交正确-spoj705 suffix array suffix array inside a template has spoj submitted in the correct
Platform: |
Size: 1024 |
Author: lilong |
Hits:
Description: This is a lecture about suffix array...Hope it helps-This is a lecture about suffix array...Hope it helps...
Platform: |
Size: 108544 |
Author: Hendrik |
Hits:
Description: 后缀数组的一个C++实现，在字符串统计中有很大作用。-Suffix array of a C++ implementation, plays a significant role in statistics in the string.
Platform: |
Size: 2048 |
Author: Fancy |
Hits:
Description: A simple to code implementation of suffix array.
Complexity : Nlog^2N
Platform: |
Size: 1024 |
Author: sn |
Hits:
Description: Linear Work Suffix Array Construction 后缀数组，一篇很好的介绍文章-Linear Work Suffix Array Construction suffix array, a very good introduction to the article
Platform: |
Size: 178176 |
Author: honghu |
Hits:
Description: 该上次资料为ACM国际大学生程序设计竞赛中必备资料，主要是后缀数组部分！里面有很多关于此方面的详细介绍！-The last data for the ACM International Collegiate Programming Contest in the necessary information, the main part is a suffix array! There are a lot of details in this regard!
Platform: |
Size: 148480 |
Author: wen hong |
Hits:
Description: This code shows you how to create a suffix array and how to use RMQ algorithm to get two suffix s longest common prefix.
Platform: |
Size: 2048 |
Author: lkq |
Hits:
Description: 一种比较新的后缀数组算法，空间和时间复杂度都是线性的，且效率比较高。-A new suffix array algorithm. Its space and time complex are all linear.
Platform: |
Size: 17408 |
Author: linge |
Hits:
Description: 写一个Java应用程序，判断两个字符串是否相同，判断字符串的前缀、后缀是否和某个字符串相同，按字典顺序比较两个字符串的大小关系，检索字符串，创建字符串，将数字型字符串转换为数字，将字符串存放到数组中，用字符数组创建字符串-Write a Java application to determine whether two strings are the same judgment string prefix, suffix and a string compare two strings lexicographically size relationship, retrieve the strings to create a string, converted to a digital numeric string, the string stored in the array, create a string array of characters. .
Platform: |
Size: 2048 |
Author: 岳野 |
Hits:
Description: arr[]为数据数列，即这个串.如果有n个数，存为arr[0]~arr[n-1],并且保证每个数大于0,小于ASCII。
调用参数前，设置：arr[n]=0,n++
这样得出的sa[]数列:sa[0]肯定等于n,即排名为0的是第n个打头的后缀串,这个是我们加上去的，是无用的。
sa[1]才表示真正的串中排名为1（即第一）的串在arr[]中的起始位置
rank[i]=j数列：以第i个打头的串排名为j,可知，rank[n]=0。
height[i]=j表示排名为i的串和它前面一个串(即i-1)的公共前缀。可知height[]的有效范围为2~n
height[1]是排名为0的和排名为1的公共前缀，而排名为0的是我们加上去的arr[n]=0,所有必定为0且没有意义-arr [] is the number of data columns, and that the string. if there are n number of save arr [0] to arr [n-1], and to ensure that each number is greater than 0 and less than an ASCII. Before the call parameters set: arr [n] = 0, n++ This gives sa [] series: sa [0] is certainly equal to n, that is ranked 0 starts with the n-suffix string, this is our plus up, is useless. sa [1] before the real string# 1 (first) string starting position rank in arr [] [i] = j series: i-starts with the string rank j, we can see rank [n] = 0. height [i] = j indicates the ranking is a string of i, and in front of it a string (i.e., i-1) of the common prefix. Seen height [] the effective range of 2 ~ n height [1] is a ranking of 0 and ranked as one of the common prefix ranked 0 we add to the arr [n] = 0, all must be 0 and does not make sense
Platform: |
Size: 1024 |
Author: 陶翔 |
Hits:
Description: 关于 poj 的几道动态规划题，线段树题后缀数组题-About poj a few dynamic programming questions, problems suffix array segment tree title
Platform: |
Size: 3072 |
Author: 吕伟涛 |
Hits:
Description: 后缀数组的构造，实现了对字符串的子串的匹配及最长重复子串的查找-Suffix array construction, the realization of a substring of string matching and longest repeat substring search
Platform: |
Size: 6144 |
Author: oeconom |
Hits:
Description: 这是一个后缀数组求字符串最大连续公共子串的模板，可以试试。-This is a suffix array seeking maximum continuous common substring string template, you can try.
Platform: |
Size: 1024 |
Author: polossk |
Hits:
Description: 后缀数组是处理字符串的有力工具。后缀数组是后缀树的一个非常精巧的替代
品，它比后缀树容易编程实现，能够实现后缀树的很多功能而时间复杂度也并不逊色，而且它
比后缀树所占用的内存空间小很多。可以说，后缀数组比后缀树要更为实用。自从拜读了罗穗
骞大牛的 WC2009 论文《后缀数组——处理字符串的有力工具》后，经过若干星期的努力（中
间有因某些原因而缓下来），终于把论文上面的练习题全部完成了，现在写写自己对后缀数组
的理解和感悟。在看本笔记时，请不要忘记了，这是笔记，而教材是《后缀数组——处理字符
串的有力工具》。 -Suffix array is a powerful tool for dealing with strings. Suffix array is a very compact alternative to the suffix tree
Products, it is easy to programming than the suffix tree, can achieve many functions suffix tree and the time complexity is not inferior, and it
Much smaller than the suffix tree occupies memory space. It can be said to be more practical than the suffix array suffix tree. Ever since I read the Lo Sui
Qian large cattle WC2009 paper- after "suffix array processing strings powerful tool," After several weeks of effort (in
Thunderstorms slow down for some reason), and finally the paper above exercises completed, and now write own suffix array
Understanding and perception. Looking at the notes, do not forget, this is the notes, and textbooks are "suffix array- processing characters
Powerful tool "string.
Platform: |
Size: 258048 |
Author: sxy |
Hits:
Description: This is a simple, bus fast implementation the suffix array.
Platform: |
Size: 249856 |
Author: Jeksonic |
Hits: