Location:
Search - Suffix array
Search list
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: 本文中笔者想介绍一下后缀数组的基本概念、构造方法，以及配合后缀数组的最长公共前缀数组的构造方法，最后结合一些例子谈谈后缀数组的应用-In this article I want to tell us about the basic concept of suffix array, construction methods, and the suffix array with the longest prefix of an array of public constructor, and finally combined with some examples to talk about the application of suffix array
Platform: |
Size: 7168 |
Author: 详迅 |
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: Suffix Arrays for Searching:implementation
Platform: |
Size: 19456 |
Author: bigmaster |
Hits:
Description: Suffix Array implementation for searching
Platform: |
Size: 2558976 |
Author: bigmaster |
Hits:
Description: suffix array library
Platform: |
Size: 395264 |
Author: iyami |
Hits:
Description: suffix array library with perl and ruby bindings
Platform: |
Size: 295936 |
Author: iyami |
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: 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: suffix array程序，dev c++编译环境，处理字符串很好的一个数据结构-suffix array
Platform: |
Size: 114688 |
Author: chiefenxu |
Hits:
Description: 倍增算法实现后缀数组，在字符串处理当中，后缀树和后缀数组都是非常有力的工具，其中后缀树大家了解得比较多，关于后缀数组则很少见于国内的资料。-suffix array
Platform: |
Size: 1024 |
Author: zdl |
Hits:
Description: 后缀数组，用于高速处理庞大的字符串匹配问题-suffix array
Platform: |
Size: 307200 |
Author: Art |
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: 后缀数组，解决字符串问题的一种重要的基础的算法-Suffix array, resolving string issues an important basic algorithm
Platform: |
Size: 1024 |
Author: 张轩 |
Hits:
Description: Book about suffix array
Platform: |
Size: 94208 |
Author: Lien Tran |
Hits:
Description: 倍增算法实现的后缀数组，主要针对的罗神的算法的具体实现-prefix doubling suffix array
Platform: |
Size: 1024 |
Author: 温明军 |
Hits:
Description: This is a simple, bus fast implementation the suffix array.
Platform: |
Size: 249856 |
Author: Jeksonic |
Hits: