,
sum_{L=0,1,..n} O(L^2) = O(n^3) = O(m ^ 1.5)
with one character per branch. This is super-linear.
On Mar 13, 12:47 am, reynald reni reni.reyn...@gmail.com wrote:
Construct an infinite family of strings over a fixed alphabet, where
the total length of the edge-labels
Chunyuan, can this complexity be still reduced with any other data structure?
On 3/13/12, Chunyuan Ge hhy...@gmail.com wrote:
it's a classic problem like Time = O(n*n), space = O(n)
On Tue, Mar 13, 2012 at 12:55 PM, InThirstOfWisdom.rr
reni.reyn...@gmail.com wrote:
Algorithm to find the
Could anyone please tell me if Suffix Trees would be appropriate here
to use? or kindly suggest me a better data structure.
On 3/13/12, reynald reni reni.reyn...@gmail.com wrote:
Chunyuan, can this complexity be still reduced with any other data
structure?
On 3/13/12, Chunyuan Ge hhy
Construct an infinite family of strings over a fixed alphabet, where
the total length of the edge-labels on their suffix tree grows faster
than O(m), where 'm' is the length of the string. [That is, show that
linear time suffix tree algorithm would be impossible if edge-labels
were written
