On 7/8/13, hubert depesz lubaczewski <depesz@depesz.com> wrote: > On Mon, Jul 08, 2013 at 09:09:26AM -0400, Robert James 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? > > I'm not entirely sure I understand. Can you show us some sample data and > expected output?