<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Recent changes to Home</title><link>https://sourceforge.net/p/clstringmatch/wiki/Home/</link><description>Recent changes to Home</description><atom:link href="https://sourceforge.net/p/clstringmatch/wiki/Home/feed" rel="self"/><language>en</language><lastBuildDate>Mon, 17 Feb 2014 16:10:36 -0000</lastBuildDate><atom:link href="https://sourceforge.net/p/clstringmatch/wiki/Home/feed" rel="self" type="application/rss+xml"/><item><title>Home modified by Victor Anyakin</title><link>https://sourceforge.net/p/clstringmatch/wiki/Home/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v10
+++ v11
@@ -10,8 +10,9 @@
 * Aho-Corasick algorithm with finite set of patterns and the Trie data structure
 * Ukkonen's [suffix tree](Suffix Tree) construction algorithm

-Additional information (see also page [Literature](Resources and Literature)):
+Additional information:

+* [Resources and Literature](Resources and Literature): collection of useful links and resources collected while working on this project
 * Article [String searching algorithm](http://en.wikipedia.org/wiki/String_searching_algorithm) on Wikipedia
 * [SourceForge Project home](http://sourceforge.net/projects/clstringmatch/)
 * [Project web](http://clstringmatch.sourceforge.net)
&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Victor Anyakin</dc:creator><pubDate>Mon, 17 Feb 2014 16:10:36 -0000</pubDate><guid>https://sourceforge.netea6ba076fbe7eeb14459776e5fbc2172cb7d8fb6</guid></item><item><title>Home modified by Victor Anyakin</title><link>https://sourceforge.net/p/clstringmatch/wiki/Home/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v9
+++ v10
@@ -8,6 +8,7 @@
 * Rabin-Karp algorithm
 * Knuth-Morris-Pratt algorithm
 * Aho-Corasick algorithm with finite set of patterns and the Trie data structure
+* Ukkonen's [suffix tree](Suffix Tree) construction algorithm

 Additional information (see also page [Literature](Resources and Literature)):

&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Victor Anyakin</dc:creator><pubDate>Fri, 06 Dec 2013 10:23:29 -0000</pubDate><guid>https://sourceforge.netf8ca047c0e8d42d76c75c8294658c4917613c2d1</guid></item><item><title>Home modified by Victor Anyakin</title><link>https://sourceforge.net/p/clstringmatch/wiki/Home/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v8
+++ v9
@@ -9,7 +9,7 @@
 * Knuth-Morris-Pratt algorithm
 * Aho-Corasick algorithm with finite set of patterns and the Trie data structure

-Additional information:
+Additional information (see also page [Literature](Resources and Literature)):

 * Article [String searching algorithm](http://en.wikipedia.org/wiki/String_searching_algorithm) on Wikipedia
 * [SourceForge Project home](http://sourceforge.net/projects/clstringmatch/)
&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Victor Anyakin</dc:creator><pubDate>Sat, 27 Jul 2013 16:05:26 -0000</pubDate><guid>https://sourceforge.netd4de9d2e8fe933704566e50b124b57d2abba3cf7</guid></item><item><title>Home modified by Victor Anyakin</title><link>https://sourceforge.net/p/clstringmatch/wiki/Home/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v7
+++ v8
@@ -7,6 +7,7 @@
 * Boyer-Moore-Horspool algorithm
 * Rabin-Karp algorithm
 * Knuth-Morris-Pratt algorithm
+* Aho-Corasick algorithm with finite set of patterns and the Trie data structure

 Additional information:

&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Victor Anyakin</dc:creator><pubDate>Mon, 15 Jul 2013 16:50:37 -0000</pubDate><guid>https://sourceforge.netda57fd45a512cb49928a25c7a7cd2564da422f17</guid></item><item><title>Home modified by Victor Anyakin</title><link>https://sourceforge.net/p/clstringmatch/wiki/Home/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v6
+++ v7
@@ -11,8 +11,9 @@
 Additional information:

 * Article [String searching algorithm](http://en.wikipedia.org/wiki/String_searching_algorithm) on Wikipedia
-* [Project home](http://sourceforge.net/projects/clstringmatch/)
+* [SourceForge Project home](http://sourceforge.net/projects/clstringmatch/)
 * [Project web](http://clstringmatch.sourceforge.net)
+* [API Reference](http://clstringmatch.sourceforge.net/api/index.html)

&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Victor Anyakin</dc:creator><pubDate>Thu, 13 Jun 2013 08:28:13 -0000</pubDate><guid>https://sourceforge.net00f41042691ae994a5bd7204fc97ce0f3f64519c</guid></item><item><title>Home modified by Victor Anyakin</title><link>https://sourceforge.net/p/clstringmatch/wiki/Home/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v5
+++ v6
@@ -1,4 +1,4 @@
-CL-STRING-MATCH aims at providing robust implementations of string matching algorithms.
+CL-STRING-MATCH aims at providing robust implementations of substring search (subsequence search) algorithms in Common Lisp.

 Currently it provides implementations of the following string matching algorithms:

&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Victor Anyakin</dc:creator><pubDate>Sun, 26 May 2013 12:13:04 -0000</pubDate><guid>https://sourceforge.net18425c9c048b389e0a3181e1535794d4c006472d</guid></item><item><title>Home modified by Victor Anyakin</title><link>https://sourceforge.net/p/clstringmatch/wiki/Home/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v4
+++ v5
@@ -4,6 +4,7 @@

 * Brute-force (also known as naïve algorithm)
 * Boyer-Moore (with mismatched character heuristic)
+* Boyer-Moore-Horspool algorithm
 * Rabin-Karp algorithm
 * Knuth-Morris-Pratt algorithm

&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Victor Anyakin</dc:creator><pubDate>Sun, 26 May 2013 12:11:52 -0000</pubDate><guid>https://sourceforge.netb4f83f91c804d6f1dfa66d099bcfe7cf11672904</guid></item><item><title>Home modified by Victor Anyakin</title><link>https://sourceforge.net/p/clstringmatch/wiki/Home/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v3
+++ v4
@@ -5,11 +5,13 @@
 * Brute-force (also known as naïve algorithm)
 * Boyer-Moore (with mismatched character heuristic)
 * Rabin-Karp algorithm
+* Knuth-Morris-Pratt algorithm

 Additional information:

 * Article [String searching algorithm](http://en.wikipedia.org/wiki/String_searching_algorithm) on Wikipedia
 * [Project home](http://sourceforge.net/projects/clstringmatch/)
+* [Project web](http://clstringmatch.sourceforge.net)

&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Victor Anyakin</dc:creator><pubDate>Tue, 21 May 2013 09:11:21 -0000</pubDate><guid>https://sourceforge.net58b6f5af8c2762787f07f4b60d25dd5f10adb0d4</guid></item><item><title>Home modified by Victor Anyakin</title><link>https://sourceforge.net/p/clstringmatch/wiki/Home/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v2
+++ v3
@@ -3,6 +3,8 @@
 Currently it provides implementations of the following string matching algorithms:

 * Brute-force (also known as naïve algorithm)
+* Boyer-Moore (with mismatched character heuristic)
+* Rabin-Karp algorithm

 Additional information:

&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Victor Anyakin</dc:creator><pubDate>Sun, 19 May 2013 16:23:45 -0000</pubDate><guid>https://sourceforge.net05d247951f053f43289c6e98ff29a4fffcaea332</guid></item><item><title>WikiPage Home modified by Victor Anyakin</title><link>https://sourceforge.net/p/clstringmatch/wiki/Home/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v1
+++ v2
@@ -1,8 +1,14 @@
-Welcome to your wiki!
+CL-STRING-MATCH aims at providing robust implementations of string matching algorithms.

-This is the default page, edit it as you see fit. To add a new page simply reference it within brackets, e.g.: [SamplePage].
+Currently it provides implementations of the following string matching algorithms:

-The wiki uses [Markdown](/p/clstringmatch/wiki/markdown_syntax/) syntax.
+* Brute-force (also known as naïve algorithm)

-[[project_admins]]
+Additional information:
+
+* Article [String searching algorithm](http://en.wikipedia.org/wiki/String_searching_algorithm) on Wikipedia
+* [Project home](http://sourceforge.net/projects/clstringmatch/)
+
+
+
 [[download_button]]
&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Victor Anyakin</dc:creator><pubDate>Wed, 16 Jan 2013 16:07:11 -0000</pubDate><guid>https://sourceforge.net24c55a8b3563a18a2170ecdb256103271646f116</guid></item></channel></rss>