Advertisement
Published in:
2010 | OriginalPaper | Chapter
Approximate String Matching with Stuck Address Bits
Authors : Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat
Published in: String Processing and Information Retrieval
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
A string
S
∈ Σ
m
can be viewed as a set of pairs
$\{ (s_i , i) \mid s_i\in S,\ i\in \{ 0,\ldots, m-1\} \}$
. We follow the recent work on
pattern matching with address errors
and consider approximate pattern matching problems arising from the setting where errors are introduced to the location component (
i
), rather than the more traditional setting, where errors are introduced to the content itself (
s
i
). Specifically, we continue the work on string matching in the presence of address bit errors. In this paper, we consider the case where bits of
i
may be stuck, either in a consistent or transient manner. We formally define the corresponding approximate pattern matching problems, and provide efficient algorithms for their resolution.