|We don't bite newbies here... much|
Re: supertree construction in perlby BrowserUk (Pope)
|on Oct 07, 2012 at 20:31 UTC||Need Help??|
You keep asking this question, but until you can describe your problem in English -- rather than dissertationease -- you're unlikely to get a solution.
You have not yet described what "a triple" is or signifies; nor provided links to a viable description of "Alfred Aho's algorithm".
And you keep introducing specialist terms -- induced subgraphs, supertrees -- that will only make sense to speciologists.
To get help with this, you will need to step back from the specialisation and explain the problem in terms that programmers will understand.
(And just to show I'm not being unnecessarily harsh here. After your first post I downloaded and read:
I'm reasonably adept at reading between the BS that these types of papers are couched in, and I did gain some insights into the nature of the problem you are trying to tackle, but in terms of trying to turn the (so-called) algorithm descriptions in those papers into a practical implementation. I'm none the wiser.)
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.