I want to build a space efficient suffix trie for all the substrings of the string; Suppose the length of the string is 5000, then number of substring would be approx 25*10^6 and for every node i m storing an array of linkd of size 26 so total memory = 26*5000*5000 which is not possible so runtime error is expected. I ve got a solution for a space efficient suffix trie in which we compress the path where we have no chooices so the order of space approximately becomes linear. But i m not able to understand so can anyone help me out of this.
How to construct a suffix Trie for all the substrings of a string?
429 Views Asked by Aditya Kumar Ghosh At
2
There are 2 best solutions below
0
dim
On
Not sure about your arithmetic... but if you have only one string your tree must be 26n size.
Technically you can substitute Suffix Trie/Tree with Suffix Array + LCP Array maintaining the same speed of basic graph operations. The memory consumption will be 1 + 4 + 4 = 9n. The drawback is that it is not easy to change the original string.
Related Questions in SUBSTRING
- Algorithm for finding the largest common substring for n strings using Rabin-Karp function
- Unable to download CSV file from web URL with runtime using python
- Is there any possible way to remove the 1st character of a String using O(1) time complexity in C++?
- Split string based on delimiter into specific substrings in python stored in multiple columns
- Can you replace a substring from a regex match?
- Check Groovy string if it matches dynamically changing substring
- Lookup every character in string and replace with character from another string
- How to make pattern matching efficient for large text datasets
- SQL - Select only records where field contains either a given string explicitly OR or a range of strings within which given string falls
- Word Count in C
- Dynamic starting position in substring and dynamic length
- split string in powershell using delimiter
- Pandas - find all Rows where special Columns contain a part of text
- Searching into an array of long strings specific things. Then save it on a JSON Object
- Substring issue when combined with map or reduce. Am I doing something wrong?
Related Questions in SUFFIX-TREE
- About Suffix Trees features
- Is a Generalized Suffix Tree a good data structure to use for string searches on a dict of strings where partial matches should also be returned?
- LZ77 using the suffix tree
- Find all the appearances of substring in the string using suffix tree
- Practical implementation of suffix array
- Finding FIRST occurrence of a substring using suffix trees
- How to solve longest already present substring in O(n)?
- Implementations for Pattern/String mining using Suffix Arrays/Trees
- Debugging a pattern-matching algorithm
- Suffix Tree - All common substrings
- How to Create Suffix Tree From String?
- Heftiest repeated substring
- Algorithm to find all duplicate sequences of tokens in a long string
- Find the longest common substring from two sentences
- linear time algorithm for finding most frequent m-letter substring in a string
Related Questions in SUFFIX-ARRAY
- Trying to quick sort a suffix array
- Optimization: Count the number of suffix pairs
- Practical implementation of suffix array
- Efficient way to collect all unique substrings of a string
- How to solve longest already present substring in O(n)?
- Suffix Array, n^2*log(n) faster than n*log^2(n) even for large inputs?
- Implementations for Pattern/String mining using Suffix Arrays/Trees
- Segmentation Fault in Suffix Array Implementation
- What is the Big O notation of a program?
- I want to define (create) and use different variable (using suffix) through loop (specially for loop)
- linear time algorithm for finding most frequent m-letter substring in a string
- Most repeated substring in a string in C
- How to find the longest common substring of n strings using suffix array?
- Which character to append to string in suffix array?
- question of skew suffix array algorithm presented in Simple Linear Work Suffix Array Construction
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
You don't search for a trie, instead for a suffix tree I think. Compressing the path is a way, but I would just search for the Ukkonen algorithm. The Time and space complexity is n. If you want something which is better to understand, just search for Suffix Arrays. The space complexity is n as well, with a lower constant (about 6 instead of 32 or so, I don't remember the exactly numbers) and much better Cache prediction through the hardware.