English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Computing the threshold for q-gram filters

Kärkkäinen, J. (2002). Computing the threshold for q-gram filters. In Algorithm theory, SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory (pp. 348-357). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2F48-7 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2F4B-1
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Kärkkäinen, Juha1, Author           
Penttonen, Martti, Editor
Meineche Schmidt, Erik, Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: A popular and much studied class of filters for approximate string matching is based on finding common $q$-grams, substrings of length $q$, between the pattern and the text. A variation of the basic idea uses \emph{gapped} $q$-grams and has been recently shown to provide significant improvements in practice. A major difficulty with gapped $q$-gram filters is the computation of the so-called \emph{threshold} which defines the filter criterium. We describe the first general method for computing the threshold for $q$-gram filters. The method is based on a carefully chosen precise statement of the problem which is then transformed into a constrained shortest path problem. In its generic form the method leaves certain parts open but is applicable to a large variety of $q$-gram filters and may be extensible even to other classes of filters. We also give a full algorithm for a specific subclass. For this subclass, the algorithm has been implemented and used succesfully in an experimental comparison.

Details

show
hide
Language(s): eng - English
 Dates: 2003-08-272002
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 202062
Other: Local-ID: C1256428004B93B8-BDE5926620208DA2C1256CE5006C7B5E-Karkkainen2002
 Degree: -

Event

show
hide
Title: SWAT 2002
Place of Event: Turku, Finland
Start-/End Date: 2002-07-03 - 2002-07-05

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 348 - 357 Identifier: ISBN: 3-540-43866-1

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 2368 Sequence Number: - Start / End Page: - Identifier: -