[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] xslt and longest common subsequence problem
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
|
PURCHASE STYLUS STUDIO ONLINE TODAY!Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced! Download The World's Best XML IDE!Accelerate XML development with our award-winning XML IDE - Download a free trial today! Subscribe in XML format
|