[xsl] xslt and longest common subsequence problem

["" <ds5j@xxxxxxxxxx>]

Hi,
  Is it a good idea to implement the longest common subsequence algorithm in an xslt stylsheet?

  In articles I have read it seems solving the longest common subsequence problem in recursive solution is not as fast as in a linear solution using matrices.

   Is XSLT optimized for recursion?  Is it faster than linear programming in XSLT?  what is a more efficient use of XSLT?

If XSLT is faster in terms of recursive solutions is anyone willing to implement the longest common subsequence in an XSLT stylesheet?

DS



_______________________________________________
Join Excite! - http://www.excite.com
The most personalized portal on the Web!

 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list