<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-23T20:16:38Z</responseDate>
  <request identifier="2738" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2738</identifier>
        <datestamp>2024-03-06T11:09:19Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" 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:title>Efficient computation of statistics for words with mismatches</dc:title>
          <dc:creator>Pizzi, Cinzia</dc:creator>
          <dc:subject>Statistics on words</dc:subject>
          <dc:subject>mismatches</dc:subject>
          <dc:subject>dynamic programming</dc:subject>
          <dc:subject>biological sequences.</dc:subject>
          <dc:description>Since early stages of bioinformatics, substrings played a crucial role in the search and discovery of significant biological signals. Despite the advent of a large number of different approaches and models toaccomplish these tasks, substrings continue to be widely used to determine statistical distributions and compositions of biological sequences at various levels of details.&#13;
Here we overview efficient algorithms that were recently proposed to&#13;
compute the actual and the expected frequency for words with k mismatches, when it is assumed that the words of interest occur at least once exactly in the sequence under analysis. Efficiency means these algorithms are polynomial in k rather than exponential as with an enumerative approach, and independent on the length of the query word.&#13;
These algorithms are all based on a common incremental approach of&#13;
a preprocessing step that allows to answer queries related to any word&#13;
occurring in the text efficiently. The same approach can be used with a&#13;
sliding window scanning of the sequence to compute the same statistics&#13;
for words of fixed lengths, even more efficiently.&#13;
The efficient computation of both expected and actual frequency of sub-&#13;
strings, combined with a study on the monotonicity of popular scores&#13;
such as z-scores, allows to build tables of feasible size in reasonable time,&#13;
and can therefore be used in practical applications.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Cinzia Pizzi</dc:contributor>
          <dc:date>2010</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 10231, Structure Discovery in Biology: Motifs, Networks &amp; Phylogenies (2010)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.10231.4</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-27384</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10231.4</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
