On Mon, Jul 8, 2013 at 6:39 PM, Robert James <srobertjames@xxxxxxxxx> wrote: > I have two relations, where each relation has two fields, one > indicating a name and one indicating a position. That is, each > relation defines a sequence. > > I need to determine their longest common subsequence. Yes, I can do > this by fetching all the data into Java (or any other language) and > computing it using the standard LCS dynamic programming language. But > I'd like to stay within Postgres. Is there any way to do this? > > > -- > Sent via pgsql-general mailing list (pgsql-general@xxxxxxxxxxxxxx) > To make changes to your subscription: > http://www.postgresql.org/mailpref/pgsql-general Pl/R is the way to go,IMO. Or any supported language. Regards, Atri -- Regards, Atri l'apprenant -- Sent via pgsql-general mailing list (pgsql-general@xxxxxxxxxxxxxx) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-general
