tag:blogger.com,1999:blog-5233088934192036312.post3967424035368542608..comments2024-01-31T08:59:57.150+02:00Comments on Keep Learning: Suffix Trees: Java Code as Separate ClassesIllya Havsiyevychhttp://www.blogger.com/profile/00309160215815501585noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-5233088934192036312.post-53718018311938343292011-03-17T01:08:22.289+02:002011-03-17T01:08:22.289+02:00Hello.
I've used a highly-modified version of...Hello.<br /><br />I've used a highly-modified version of your code in a music composition system (as part of a university research project). <br /><br />As I couldn't find licensing information anywhere, could you confirm that you're okay with this? The code shall be properly attributed.<br /><br />Many thanksUnknownhttps://www.blogger.com/profile/09634783102044989600noreply@blogger.comtag:blogger.com,1999:blog-5233088934192036312.post-32732580095053233162010-03-03T19:04:49.787+02:002010-03-03T19:04:49.787+02:00hello
your code has been a great help to understa...hello<br /><br />your code has been a great help to understand ukkonen's algorithm a little better.<br /><br />I am trying to build a program that accepts a text and a prefix and builds a prefixed subtree of the suffix tree.<br /><br />For example, given cacao$ and c, it should only add cacao$ and cao$ suffixes to the suffix tree and not acao$, ao$ and o$<br /><br />This - at least for my level of understanding the ukkonen algorithm - is not as easy as only calling addPrefix for certain characters of the text. Nor is it as simple as manipulating the active suffix externally (out of addPrefix).<br /><br />Maybe you are aware of some other implementation/paper that accommodates this. Or can make some suggestions.<br /><br />thanks in advanceUnknownhttps://www.blogger.com/profile/14280773704250897115noreply@blogger.com