1 Ocak 2007 Konferans bildirisi Açık Erişim

Kuelekci, A. Oguzhan

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Kuelekci, A. Oguzhan</dc:creator>
  <dc:date>2007-01-01</dc:date>
  <dc:description>In pattern matching, scanning a given pattern in a particular order greatly influences the performance. This study investigates the effect of different pattern scan orders on natural language text and on DNA sequence data. Besides the well-known right-to-left ordering of Boyer-Moore, and from the least frequent character to most frequent one of Sunday's optimal mismatch algorithm, four alternative character search sequence orderings based on newly introduced distant n-gram statistics are proposed within this work. In all experiments, Sunday's pattern matching algorithm, where the characters of a given pattern can be scanned in any order, is used as the main framework. On natural language test data, the alternative pattern scan orders give better results in 60% of the test keywords. On genome data best ordering among the tested six approaches is the right-to-left order.</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/97839</dc:identifier>
  <dc:identifier>oai:zenodo.org:97839</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:title>An empirical analysis of pattern scan order in pattern matching</dc:title>
  <dc:type>info:eu-repo/semantics/conferencePaper</dc:type>
  <dc:type>publication-conferencepaper</dc:type>
</oai_dc:dc>