<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Netvouz / mcswell / folder / String Algorithms</title>
<link>http://netvouz.com/mcswell/folder/4417908445325541556/Algorithms+String+Algorithms?feed=rss</link>
<description>mcswell&#39;s bookmarks in folder String Algorithms on Netvouz</description>
<item><title>AGREP</title>
<link>http://www.tgries.de/agrep/</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>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>fuzzy matching transliteration</title>
<link>http://scholar.google.com/scholar?hl=en&amp;lr=&amp;q=fuzzy+matching+transliteration&amp;btnG=Search</link>
<description>Google Scholar links to papers on fuzzy matching in transliteration.</description>
<category domain="http://netvouz.com/mcswell?category=4417908445325541556">Algorithms &gt; String Algorithms</category>
<author>mcswell</author>
<pubDate>Wed, 07 Jun 2006 13:02:02 GMT</pubDate>
</item><item><title>Levenshtein Distance</title>
<link>http://www.merriampark.com/ld.htm</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>levenshtein transliteration</title>
<link>http://scholar.google.com/scholar?hl=en&amp;lr=&amp;q=levenshtein+transliteration&amp;btnG=Search</link>
<description>Google Scholar links to papers on Levenshtein transliteration</description>
<category domain="http://netvouz.com/mcswell?category=4417908445325541556">Algorithms &gt; String Algorithms</category>
<author>mcswell</author>
<pubDate>Wed, 07 Jun 2006 13:02:53 GMT</pubDate>
</item><item><title>Pattern Matching Pointers</title>
<link>http://www.cs.ucr.edu/~stelo/pattern.html</link>
<description></description>
<category domain="http://netvouz.com/mcswell?category=4417908445325541556">Algorithms &gt; String Algorithms</category>
<author>mcswell</author>
<pubDate>Mon, 20 Feb 2006 15:02:52 GMT</pubDate>
</item><item><title>Pattern Matching Pointers  maintained by Stefano Lonardi</title>
<link>http://www.cs.ucr.edu/%7Estelo/pattern.html</link>
<description>Pointers to literature, implementations etc. of a wide variety of string matching algorithms.</description>
<category domain="http://netvouz.com/mcswell?category=4417908445325541556">Algorithms &gt; String Algorithms</category>
<author>mcswell</author>
<pubDate>Mon, 29 Sep 2008 20:03:50 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><item><title>Text Searching and Processing</title>
<link>http://www-igm.univ-mlv.fr/~mac/ENS/TSP.html</link>
<description>This is a part of the course &quot;Text Searching and Processing&quot; of the Master in Advanced Computing delivered by the Department of Computer Science of King&#39;s College London. It contains lectures on string searching algorithms and on text indexing methods.</description>
<category domain="http://netvouz.com/mcswell?category=4417908445325541556">Algorithms &gt; String Algorithms</category>
<author>mcswell</author>
<pubDate>Fri, 02 Feb 2007 02:06:56 GMT</pubDate>
</item></channel></rss>