<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Netvouz / mcswell / tag / trees</title>
<link>http://netvouz.com/mcswell/tag/trees?feed=rss</link>
<description>mcswell&#39;s bookmarks tagged &quot;trees&quot; on Netvouz</description>
<item><title>Daniel Gusfield</title>
<link>http://wwwcsif.cs.ucdavis.edu/~gusfield/</link>
<description></description>
<category domain="http://netvouz.com/mcswell?category=4417908445325541556">Algorithms &gt; String Algorithms</category>
<author>mcswell</author>
<pubDate>Thu, 18 Nov 2004 15:10:40 GMT</pubDate>
</item><item><title>Fast Algorithm for Making Suffix Arrays and for Burrows-Wheeler Transformation</title>
<link>http://citeseer.ist.psu.edu/sadakane98fast.html</link>
<description>We propose a fast and memory efficient algorithm for sorting suffixes of a text in lexicographic order. It is important to sort suffixes because an array of indexes of suffixes is called suffix array and it is a memory efficient alternative of the suffix tree. Sorting suffixes is also used for the Burrows-Wheeler transformation in the Block Sorting text compression, therefore fast sorting algorithms are desired. We compare algorithms...</description>
<category domain="http://netvouz.com/mcswell?category=4417908445325541556">Algorithms &gt; String Algorithms</category>
<author>mcswell</author>
<pubDate>Thu, 18 Nov 2004 15:10:40 GMT</pubDate>
</item><item><title>Suffix Trees</title>
<link>http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Tree/Suffix.html</link>
<description></description>
<category domain="http://netvouz.com/mcswell?category=4417908445325541556">Algorithms &gt; String Algorithms</category>
<author>mcswell</author>
<pubDate>Thu, 18 Nov 2004 15:10:40 GMT</pubDate>
</item></channel></rss>