<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:cc="http://web.resource.org/cc/"
 xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:syn="http://purl.org/rss/1.0/modules/syndication/"
 xmlns:content="http://purl.org/rss/1.0/modules/content/"
 xmlns:admin="http://webns.net/mvcb/"
>

<channel rdf:about="http://www.bibsonomy.org/author/Hyyr%C3%B6">
  <title>BibSonomy publications for /author/Hyyr%C3%B6</title>
  <link>http://www.bibsonomy.org/author/Hyyr%C3%B6</link>
  <description>BibSonomy RSS Feed for /author/Hyyr%C3%B6</description>

  <items>
    <rdf:Seq>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/255a52021611df8d9d2b4d15d176efab0/dblp"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2422e674e1a3de84bb485dba2afa4be87/dblp"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2555beef315e342a2cadb608134d5b0fd/dblp"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/25acc99308e18cece0318471ee2279556/dblp"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2b781142c2011599bee9e78c235a2b919/dblp"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/27647daf53f3c46bff7ab25d918717763/thomas"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/27647daf53f3c46bff7ab25d918717763/tmalsburg"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f149dbc004332fe99dc3c47d601367a9/dblp"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/220144e922aa843c5f91d32a0226ce330/dblp"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2adf832fb3526d902423ac9eba9f6bf7c/dblp"/>
      </rdf:Seq>
  </items>
</channel>

<item rdf:about="http://www.bibsonomy.org/bibtex/255a52021611df8d9d2b4d15d176efab0/dblp">
    <title>An Efficient Linear Space Algorithm for Consecutive Suffix Alignment under Edit Distance (Short Preliminary Paper).</title>
    <description>dblp</description>
    <link>http://www.bibsonomy.org/bibtex/255a52021611df8d9d2b4d15d176efab0/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2008-11-24T00:00:00+01:00</dc:date>
    <dc:subject>
      dblp </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/255a52021611df8d9d2b4d15d176efab0/dblp">An Efficient Linear Space Algorithm for Consecutive Suffix Alignment under Edit Distance (Short Preliminary Paper).</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Heikki <a href="http://www.bibsonomy.org/author/Hyyr%C3%B6">Hyyrö</a>         	     	 
        	 </span> 
  <em>SPIRE</em>
    155-163
  (2008)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2008-11-24 00:00:00 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
  </item>
<item rdf:about="http://www.bibsonomy.org/bibtex/2422e674e1a3de84bb485dba2afa4be87/dblp">
    <title>Bit-parallel computation of local similarity score matrices with unitary weights.</title>
    <description>dblp</description>
    <link>http://www.bibsonomy.org/bibtex/2422e674e1a3de84bb485dba2afa4be87/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2007-06-28T00:00:00+02:00</dc:date>
    <dc:subject>
      dblp </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/2422e674e1a3de84bb485dba2afa4be87/dblp">Bit-parallel computation of local similarity score matrices with unitary weights.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Heikki <a href="http://www.bibsonomy.org/author/Hyyr%C3%B6">Hyyrö</a>         	     	 
        	  and Gonzalo <a href="http://www.bibsonomy.org/author/Navarro">Navarro</a>         	     	 
        	 </span> 
  <em>Stringology</em>
    95-108
  (2005)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2007-06-28 00:00:00 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
  </item>
<item rdf:about="http://www.bibsonomy.org/bibtex/2555beef315e342a2cadb608134d5b0fd/dblp">
    <title>Increased bit-parallelism for approximate and multiple string matching.</title>
    <description>dblp</description>
    <link>http://www.bibsonomy.org/bibtex/2555beef315e342a2cadb608134d5b0fd/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2007-03-06T00:00:00+01:00</dc:date>
    <dc:subject>
      dblp </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/2555beef315e342a2cadb608134d5b0fd/dblp">Increased bit-parallelism for approximate and multiple string matching.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Heikki <a href="http://www.bibsonomy.org/author/Hyyr%C3%B6">Hyyrö</a>         	     	 
        	  and Kimmo <a href="http://www.bibsonomy.org/author/Fredriksson">Fredriksson</a>         	     	 
        	  and Gonzalo <a href="http://www.bibsonomy.org/author/Navarro">Navarro</a>         	     	 
        	 </span> 
  <em>ACM Journal of Experimental Algorithms</em>
      <b>10</b>
      
  (2005)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2007-03-06 00:00:00 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
  </item>
<item rdf:about="http://www.bibsonomy.org/bibtex/25acc99308e18cece0318471ee2279556/dblp">
    <title>Bit-parallel Computation of Local Similarity Score Matrices with Unitary Weights.</title>
    <description>dblp</description>
    <link>http://www.bibsonomy.org/bibtex/25acc99308e18cece0318471ee2279556/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2007-02-26T00:00:00+01:00</dc:date>
    <dc:subject>
      dblp </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/25acc99308e18cece0318471ee2279556/dblp">Bit-parallel Computation of Local Similarity Score Matrices with Unitary Weights.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Heikki <a href="http://www.bibsonomy.org/author/Hyyr%C3%B6">Hyyrö</a>         	     	 
        	  and Gonzalo <a href="http://www.bibsonomy.org/author/Navarro">Navarro</a>         	     	 
        	 </span> 
  <em>Int. J. Found. Comput. Sci.</em>
      <b>17</b>
      1325-1344
  (2006)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2007-02-26 00:00:00 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
  </item>
<item rdf:about="http://www.bibsonomy.org/bibtex/2b781142c2011599bee9e78c235a2b919/dblp">
    <title>Tighter Packed Bit-Parallel NFA for Approximate String Matching.</title>
    <description>dblp</description>
    <link>http://www.bibsonomy.org/bibtex/2b781142c2011599bee9e78c235a2b919/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2006-12-13T00:00:00+01:00</dc:date>
    <dc:subject>
      dblp </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/2b781142c2011599bee9e78c235a2b919/dblp">Tighter Packed Bit-Parallel NFA for Approximate String Matching.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Heikki <a href="http://www.bibsonomy.org/author/Hyyr%C3%B6">Hyyrö</a>         	     	 
        	 </span> 
  <em>CIAA</em>
    287-289
  (2006)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2006-12-13 00:00:00 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
  </item>
<item rdf:about="http://www.bibsonomy.org/bibtex/27647daf53f3c46bff7ab25d918717763/thomas">
    <title>A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances.</title>
    <description>about Levenshtein and Damerau editdistanz from dblp</description>
    <link>http://www.bibsonomy.org/bibtex/27647daf53f3c46bff7ab25d918717763/thomas</link>
    <dc:creator>thomas</dc:creator>
    <dc:date>2006-10-07T22:13:55+02:00</dc:date>
    <dc:subject>
      PDF damerau distance levenshtein matching uni </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/27647daf53f3c46bff7ab25d918717763/thomas">A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Heikki <a href="http://www.bibsonomy.org/author/Hyyr%C3%B6">Hyyrö</a>         	     	 
        	 </span> 
  <em>Nord. J. Comput.</em>
      <b>10</b>
      29-39
  (2003)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/thomas/PDF">PDF</a>
        <a href="http://www.bibsonomy.org/user/thomas/damerau">damerau</a>
        <a href="http://www.bibsonomy.org/user/thomas/distance">distance</a>
        <a href="http://www.bibsonomy.org/user/thomas/levenshtein">levenshtein</a>
        <a href="http://www.bibsonomy.org/user/thomas/matching">matching</a>
        <a href="http://www.bibsonomy.org/user/thomas/uni">uni</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/thomas">thomas</a> 
        
            and <a style="background-color: rgb(94%, 94%, 94%);" href="http://www.bibsonomy.org/bibtex/1e378e3e7081bc260d3789d05fe66989c">2 other people</a>
          
        
        on 2006-10-07 22:13:55 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/PDF" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/damerau" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/distance" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/levenshtein" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/matching" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/uni" />
        </rdf:Bag>
    </taxo:topics>
  </item>
<item rdf:about="http://www.bibsonomy.org/bibtex/27647daf53f3c46bff7ab25d918717763/tmalsburg">
    <title>A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances.</title>
    <description>about Levenshtein and Damerau editdistanz from dblp</description>
    <link>http://www.bibsonomy.org/bibtex/27647daf53f3c46bff7ab25d918717763/tmalsburg</link>
    <dc:creator>tmalsburg</dc:creator>
    <dc:date>2006-05-14T11:44:27+02:00</dc:date>
    <dc:subject>
      B_scanpathsimilarity algorithm article editdistance stringsimilarity toread </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/27647daf53f3c46bff7ab25d918717763/tmalsburg">A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Heikki <a href="http://www.bibsonomy.org/author/Hyyr%C3%B6">Hyyrö</a>         	     	 
        	 </span> 
  <em>Nord. J. Comput.</em>
      <b>10</b>
      29-39
  (2003)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/tmalsburg/B_scanpathsimilarity">B_scanpathsimilarity</a>
        <a href="http://www.bibsonomy.org/user/tmalsburg/algorithm">algorithm</a>
        <a href="http://www.bibsonomy.org/user/tmalsburg/article">article</a>
        <a href="http://www.bibsonomy.org/user/tmalsburg/editdistance">editdistance</a>
        <a href="http://www.bibsonomy.org/user/tmalsburg/stringsimilarity">stringsimilarity</a>
        <a href="http://www.bibsonomy.org/user/tmalsburg/toread">toread</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/tmalsburg">tmalsburg</a> 
        
            and <a style="background-color: rgb(94%, 94%, 94%);" href="http://www.bibsonomy.org/bibtex/1e378e3e7081bc260d3789d05fe66989c">2 other people</a>
          
        
        on 2006-05-14 11:44:27 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/B_scanpathsimilarity" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/article" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/editdistance" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/stringsimilarity" />
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/toread" />
        </rdf:Bag>
    </taxo:topics>
  </item>
<item rdf:about="http://www.bibsonomy.org/bibtex/2f149dbc004332fe99dc3c47d601367a9/dblp">
    <title>A Note on Bit-Parallel Alignment Computation.</title>
    <description>dblp</description>
    <link>http://www.bibsonomy.org/bibtex/2f149dbc004332fe99dc3c47d601367a9/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2006-03-08T00:00:00+01:00</dc:date>
    <dc:subject>
      dblp </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/2f149dbc004332fe99dc3c47d601367a9/dblp">A Note on Bit-Parallel Alignment Computation.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Heikki <a href="http://www.bibsonomy.org/author/Hyyr%C3%B6">Hyyrö</a>         	     	 
        	 </span> 
  <em>Stringology</em>
    79-87
  (2004)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2006-03-08 00:00:00 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
  </item>
<item rdf:about="http://www.bibsonomy.org/bibtex/220144e922aa843c5f91d32a0226ce330/dblp">
    <title>An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs.</title>
    <description>dblp</description>
    <link>http://www.bibsonomy.org/bibtex/220144e922aa843c5f91d32a0226ce330/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2006-02-09T00:00:00+01:00</dc:date>
    <dc:subject>
      dblp </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/220144e922aa843c5f91d32a0226ce330/dblp">An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Hideo <a href="http://www.bibsonomy.org/author/Bannai">Bannai</a>         	     	 
        	  and Heikki <a href="http://www.bibsonomy.org/author/Hyyr%C3%B6">Hyyrö</a>         	     	 
        	  and Ayumi <a href="http://www.bibsonomy.org/author/Shinohara">Shinohara</a>         	     	 
        	  and Masayuki <a href="http://www.bibsonomy.org/author/Takeda">Takeda</a>         	     	 
        	  and Kenta <a href="http://www.bibsonomy.org/author/Nakai">Nakai</a>         	     	 
        	  and Satoru <a href="http://www.bibsonomy.org/author/Miyano">Miyano</a>         	     	 
        	 </span> 
  <em>IEEE/ACM Trans. Comput. Biology Bioinform.</em>
      <b>1</b>
      159-170
  (2004)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2006-02-09 00:00:00 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
  </item>
<item rdf:about="http://www.bibsonomy.org/bibtex/2adf832fb3526d902423ac9eba9f6bf7c/dblp">
    <title>Bit-parallel approximate string matching algorithms with transposition.</title>
    <description>dblp</description>
    <link>http://www.bibsonomy.org/bibtex/2adf832fb3526d902423ac9eba9f6bf7c/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2006-02-08T00:00:00+01:00</dc:date>
    <dc:subject>
      dblp </dc:subject>
    <content:encoded><![CDATA[
    <link rel="stylesheet" href="http://www.bibsonomy.org/resources/css/rss.css" type="text/css"/>
    <div class="block">
      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/2adf832fb3526d902423ac9eba9f6bf7c/dblp">Bit-parallel approximate string matching algorithms with transposition.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Heikki <a href="http://www.bibsonomy.org/author/Hyyr%C3%B6">Hyyrö</a>         	     	 
        	 </span> 
  <em>J. Discrete Algorithms</em>
      <b>3</b>
      215-229
  (2005)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2006-02-08 00:00:00 </span></div>
    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
  </item>
</rdf:RDF>