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
2
votes
1 answer

hash table suffix tree explanation

I am asking this here because I couldn't find the answer I am looking for elsewhere and I don't know where else I could ask this. I hope someone can reply without saying that the question is irrelevant to the forum. I have a biology background and I…
user3691288
  • 37
  • 7
2
votes
1 answer

Is suffix tree unique?

I'm working on suffix tree algorithm in bioinformatics. I want know this , is suffix tree unique ? for example , String str = "xabaxe" This string or another example strings have alternative suffix tree?
seniorc
  • 69
  • 1
  • 2
  • 6
2
votes
2 answers

Ukkonen's suffix tree algorithm, what is necessary?

Yes I have read this: Ukkonen's suffix tree algorithm in plain English? It is a great explanation of the algorithm but it is not so much the algorithm itself that is killing me but rather the data structure used to implement it. I need the data…
E.Cross
  • 2,087
  • 5
  • 31
  • 39
2
votes
2 answers

Why we don't use prefix tree (trie) to find longest common substring?

Recently I am learning how to use tree to solve the longest common substring problem. After learning from Wiki and other online resources, I found that we should use suffix tree to find longest common substring. As the wiki said: The longest…
JoJo
  • 1,377
  • 3
  • 14
  • 28
2
votes
1 answer

Effective approach on fast look up of unique words in C#

I have the following problem. I have to store a list of unique words in multiple languages in memory and of course when I add new words I have to check whether the new word already exist. Of course this needs to be blazingly fast, primarily because…
Itay Grudev
  • 7,055
  • 4
  • 54
  • 86
2
votes
2 answers

What is a Suffix Automaton?

Can someone please explain to me what exactly is a suffix automaton, and how it works and differs from suffix trees and suffix arrays? I have already tried searching on the web but was not able to come across any clear comprehensive explanation. I…
KayEs
  • 135
  • 8
2
votes
1 answer

How can we use Ukkonen's suffix tree to identify all the common substrings within a document. vc++

I am trying to use ukkonen's suffix tree to compare documents. At this point I'm concerning about two things: First I'm trying to generate the suffix tree for one document and then use that suffix tree to find all common substrings within that…
user1815763
  • 103
  • 2
  • 10
2
votes
0 answers

Latest research on suffix arrays vs suffix trees

I've been trying to ascertain whether suffix trees or suffix arrays (including their variants) are more space efficient (amongst other properties as given below), but I seem to be coming up with different viewpoints depending on where I look. This…
user3150164
  • 21
  • 2
2
votes
2 answers

What are the differences between suffix links and failure links?

I am studying algorithms in this semester and have read about the Aho-Corasick string matching algorithm and Ukkonen's algorithm for building suffix trees. I read both of them for but can't understand the main basic differences of these two, except…
FatimaAsif
  • 131
  • 1
  • 14
2
votes
0 answers

Can we use suffix tree to count numbers of distinct subsequence?

Can we use suffix tree to count numbers of distinct subsequence (rather than substring)? Definition: A subsequence of a string is a new string which is formed from the original string by deleting some of the characters without disturbing the…
Eric H.
  • 341
  • 2
  • 7
  • 18
2
votes
2 answers

how to find all the possible longest common subsequence from the same position

I am trying to find all the possible longest common subsequence from the same position of multiple fixed length strings (there are 700 strings in total, each string have 25 alphabets ). The longest common subsequence must contain at least 3…
user2405694
  • 847
  • 2
  • 8
  • 19
2
votes
1 answer

Maximum and minimum number of edges in a suffix tree

What are the maximum and minimum number of edges in a suffix tree? I know the maximum is 2m-1, but I don't understand why that is so.
Ansari
  • 1,907
  • 2
  • 23
  • 34
2
votes
2 answers

Python Running out of Memory (Using Suffix Trees)

I'm running into a bit of trouble with some code. Please bear in mind that I'm a terrible programmer, so my solution probably isn't very eloquent (and likely the reason why I'm running out of memory - I have 4 gigabytes and the script slowly fills…
mstcamus
  • 91
  • 4
2
votes
1 answer

Document retrieval with unwanted words

I am building a data structure that helps indexing a collection of S documents of total length n, such that it supports the following query: Given two words P1 and P2, count all the documents that contain P1 but not P2. I want the answer to be…
Adi Sherf
  • 33
  • 4
2
votes
1 answer

Longest palindromic substring and suffix trie

I was Googling about a rather well-known problem, namely: the longest palindromic substring I have found links that recommend suffix tries as a good solution to the problem. Example SO and Algos The approach is (as I understand it) e.g. for a string…
Cratylus
  • 52,998
  • 69
  • 209
  • 339
1 2 3
…
15 16