You are not logged in. Please login at to post your questions!


LCS via Suffix Automaton

Need help in finding the LCS of two strings vis suffix automata. |S|<=25000. I am able to construct the suffix automata for a pattern P[] but am unable to understand how to calculate the LCS.

How do I use the transition function?

PS:Query is because I was unable to understand the editorial of SSTORY.

Any help is appreciated! Thanks.

asked 28 Jul '14, 18:49

ironmandhruv's gravatar image

accept rate: 20%

could you please describe the suffix automata construction for pattern


answered 25 May '15, 11:52

rnagarjuna's gravatar image

accept rate: 0%

toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text]( "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:


question asked: 28 Jul '14, 18:49

question was seen: 3,081 times

last updated: 26 May '15, 16:48