1. For this question we will consider the following problem.
D: a document which is a sequence of tokens (t1; : : : ; tn)
where n 1 and for 1 i n the token ti
is a string of characters.
L: a sequence of words (w1; : : : ; wm) where m 1 and for
1 i m the word w is a string of characters.
The longest token in the sequence D that is a substring of
all of the words in L.
If none of the tokens in D are substrings of the words in L
then the empty string should be returned.
A string x is a substring of a string y if the string x can be
found anywhere within y.
Note that a string is a substring of itself.
look up the rest tin the attachment file
9 freelancers are bidding on average £64 for this job
Hello. I can esily help you. I'm Ph.D. in mathematics with extensive knowledge in solving of such problems. I'm the best mathematician here and completed all my projects with the best rates. I'm ready to help you.
Hi, I am a programmer with 10 years of experience. I can code this problem for you, with perfect results. I can begin working today and deliver in 1-2 days' time. Thank you very much!
Hi, I am very good in algorithms and data structures. I am IIT delhi, computer science graduate. This problem can be done suffix tree in O(|D|+|L|) . Thanks Ashish
I have a masters degree in Computer Science. I was one of the top five students at my university. I have also worked a couple of years at jobs that required algoritmic analisys.