﻿<?xml version='1.0' encoding='UTF-8'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/"><channel><title>SQLServerCentral / SQL Server 2005 / T-SQL (SS2K5)  / Matching Subsequences / Latest Posts</title><generator>InstantForum.NET v2.9.0</generator><description>SQLServerCentral</description><link>http://www.sqlservercentral.com/Forums/</link><webMaster>notifications@sqlservercentral.com</webMaster><lastBuildDate>Wed, 19 Jun 2013 05:14:55 GMT</lastBuildDate><ttl>20</ttl><item><title>Matching Subsequences</title><link>http://www.sqlservercentral.com/Forums/Topic677002-338-1.aspx</link><description>In an effort to compare the text of two stored procedures, I generalized the problem and created code that will match subsequences of any two given sequences. I first created an iterative algorithm, then later rewrote it as a recursive CTE that blows the doors off of the original (the most recent code can be found under [url]http://www.sqlservercentral.com/scripts/TSQL/66074/[/url]). I'm curious if anyone could suggest an alternative to this approach, let me know if I'm missing anything, etc.? I wrote about my findings in my blog: [url]http://jessesql.blogspot.com/2009/02/comparing-stored-procedures-part-1.html[/url].</description><pubDate>Mon, 16 Mar 2009 15:47:34 GMT</pubDate><dc:creator>Jesse McLain</dc:creator></item></channel></rss>