[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

xslt and longest common subsequence problem

Subject: xslt and longest common subsequence problem
From: "" <ds5j@xxxxxxxxxx>
Date: Sun, 2 Mar 2003 18:34:37 -0500 (EST)
longest common subsequence
  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?


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

Current Thread


Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!

Buy Stylus Studio Now

Download The World's Best XML IDE!

Accelerate XML development with our award-winning XML IDE - Download a free trial today!

Don't miss another message! Subscribe to this list today.
First Name
Last Name
Subscribe in XML format
RSS 2.0
Atom 0.3
Site Map | Privacy Policy | Terms of Use | Trademarks
Free Stylus Studio XML Training:
W3C Member
Stylus Studio® and DataDirect XQuery ™are products from DataDirect Technologies, is a registered trademark of Progress Software Corporation, in the U.S. and other countries. © 2004-2013 All Rights Reserved.