Fast index for approximate string matching

Dekel Tsur

doi:10.1016/j.jda.2010.08.002

Fast index for approximate string matching

Dekel Tsur

Research output: Contribution to journal › Article › peer-review

15 Scopus citations

Abstract

We present an index that stores a text of length n such that given a pattern of length m, all the substrings of the text that are within Hamming distance (or edit distance) at most k from the pattern are reported in O(m+loglogn+#matches) time (for constant k). The space complexity of the index is O(n1+ε) for any constant ε>0.

Original language	English
Pages (from-to)	339-345
Number of pages	7
Journal	Journal of Discrete Algorithms
Volume	8
Issue number	4
DOIs	https://doi.org/10.1016/j.jda.2010.08.002
State	Published - 1 Dec 2010

Keywords

Approximate pattern matching
Text indexing

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/j.jda.2010.08.002

Cite this

@article{9dc9784c5a874c518ad08c03f7a50e31,

title = "Fast index for approximate string matching",

abstract = "We present an index that stores a text of length n such that given a pattern of length m, all the substrings of the text that are within Hamming distance (or edit distance) at most k from the pattern are reported in O(m+loglogn+\#matches) time (for constant k). The space complexity of the index is O(n1+ε) for any constant ε>0.",

keywords = "Approximate pattern matching, Text indexing",

author = "Dekel Tsur",

year = "2010",

month = dec,

day = "1",

doi = "10.1016/j.jda.2010.08.002",

language = "English",

volume = "8",

pages = "339--345",

journal = "Journal of Discrete Algorithms",

issn = "1570-8667",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

T1 - Fast index for approximate string matching

AU - Tsur, Dekel

PY - 2010/12/1

Y1 - 2010/12/1

N2 - We present an index that stores a text of length n such that given a pattern of length m, all the substrings of the text that are within Hamming distance (or edit distance) at most k from the pattern are reported in O(m+loglogn+#matches) time (for constant k). The space complexity of the index is O(n1+ε) for any constant ε>0.

AB - We present an index that stores a text of length n such that given a pattern of length m, all the substrings of the text that are within Hamming distance (or edit distance) at most k from the pattern are reported in O(m+loglogn+#matches) time (for constant k). The space complexity of the index is O(n1+ε) for any constant ε>0.

KW - Approximate pattern matching

KW - Text indexing

UR - https://www.scopus.com/pages/publications/78049345440

U2 - 10.1016/j.jda.2010.08.002

DO - 10.1016/j.jda.2010.08.002

M3 - Article

AN - SCOPUS:78049345440

SN - 1570-8667

VL - 8

SP - 339

EP - 345

JO - Journal of Discrete Algorithms

JF - Journal of Discrete Algorithms

IS - 4

ER -

Fast index for approximate string matching

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this