Stack Overflow
Stack Overflow

Questions tagged [suffix-tree]

A suffix tree is a data structure that stores all suffixes of a string. It is the basis for many fast algorithms on strings.

228 questions
0
votes
1 answer

What does this symbol do in C?

I'm learning about suffix tree and I found a site explaining it very well, but just the theory. The code is well commented but I found what seems to be an operator I will leave the site where I found it and also the code snippet I'm trying to…
Jose Carlos Filho
  • 43
  • 1
  • 4
0
votes
0 answers

How to match most specific string from a collection of strings

I want to search a collection of strings to find the most specific match from left to right. Each string can have some associated data that must be returned when a match occurs. Matches must be returned in the order of specificness. That is I should…
peter
  • 95
  • 8
0
votes
1 answer

Why do we make clone for some nodes in Suffix Automata Algorithm?

I have been studying about Suffix Automata string matching algorithm for a few days. I watched these videos and reed documents but I really can't get why we need to make a new node (under special condition) and clone it. I know how it works now but…
Azzurro94
  • 479
  • 1
  • 7
  • 19
0
votes
0 answers

Is it possible to build a suffix trie for unordered sets instead of strings?

I'm trying to write an algorithm for computing a maximal suffix tree / trie /array for a list of "unordered strings" (i.e. sets of characters). The goal is to minimally represent these sets in memory. Is there such an algorithm already? As an…
Alexander Brassel
  • 55
  • 8
0
votes
0 answers

Suffix-tree Detection of repeated string in sequences

I have a collection of k (k>2) sequences. I need an algorithm that detects repeats (i.e. the appearance of the same string twice) in every sequence, where that repeated string is the same in all sequences. Also, I am wondering if there are any…
George Verouchis
  • 150
  • 9
0
votes
1 answer

Shortest not repeatable Substring with Suffix-Tree

I need to design an efficient algorithm that finds the Shortest non-repeatable Substring in a text. In essence; the shortest string that appears only once in a text. This has to be made only with suffix-tree Example 1: Text: AATGCCTA then Result:…
George Verouchis
  • 150
  • 9
0
votes
1 answer

Is there a ready-to-use unsupervised multi-string-based pattern discovery library/software?

strace is a command that traces system calls and signals. An example of its output: poll([{fd=11, events=POLLIN}, {fd=12, events=POLLIN}, {fd=30, events=POLLIN}, {fd=31, events=POLLIN}, {fd=104, events=POLLIN}], 5, 11) = 0 (Timeout) recvmsg(30,…
user26742873
  • 919
  • 6
  • 21
0
votes
1 answer

Suffix Trie matching, problem with matching operation

I am facing a problem with suffix Trie matching, I designed a suffix trie with a 26-way tree to represent characters in a node plus a value associated with each node. The value of each node denotes either the index where the string ( if it is a…
Pawan Nirpal
  • 565
  • 1
  • 12
  • 29
0
votes
0 answers

Does the building of a suffix tree via trivial algorithm require to build a suffix trie as a first stage?

I'm just learning suffix trees/tries and trying to at first implement it via some trivial algorithm (non-linear). The trivial algorithm requires adding the suffixes of a string consequently and in some stage, we may have some suffix which will be…
user3336051
0
votes
0 answers

Difference between suffix-automation and Ukkonen-suffix tree

I have been reading Ukkonen suffix tree algorithm from below link https://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-6/ And for understanding suffix-link i found the below link…
mubir
  • 719
  • 1
  • 8
  • 15
0
votes
0 answers

fast regex matching in list

Regular Expressions: Search in list I want to have a fast way to match a regex in a list. The above solution has a linear complexity wrt the length of the list. Given things like suffix-array or suffix-tree for pure string search, is there something…
user1424739
  • 11,937
  • 17
  • 63
  • 152
0
votes
1 answer

How to generate all palindrome substrings with trie (or suffix trie)?

Given a string "ababacba", how can I generate all possible palindrome substrings? I was thinking of an approach of the following: Generate a suffix trie with the original string Reverse the string Generate all suffixes of the reversed string For…
alphawolf
  • 13
  • 5
0
votes
2 answers

Suffix tree search time

Does anyone know the reason for the statement below? Or is there a better website to ask this type of question? Any pointer would be appreciated. If a pattern occurs in a text (of length n) k times, the search of the pattern for all those k times…
user685275
  • 2,097
  • 8
  • 26
  • 32
0
votes
0 answers

Does std::string::find() use KMP or a suffix tree?

I wonder which algorithm is used for matching a pattern against a string in the standard library. A suffix tree would be the best choice if one has got more search to perform within the same string. Is that the data structure behind…
Nisba
  • 3,210
  • 2
  • 27
  • 46
0
votes
1 answer

Suffix tree of large (10Mb) text taking excessive memory

I implemented (see code below) the absolute minimal generalized suffix tree building algorithm. I wrote a unit test and it seems to work as expected (finds the right substring at the right position) . But the tree is impractically large. Question:…
Sergiy Migdalskiy
  • 996
  • 9
  • 19
1 2 3
…
15 16