Approximate string matching with address bit errors

Amihood Amir; Yonatan Aumann; Oren Kapah; Avivit Levy; Ely Porat

doi:10.1016/j.tcs.2009.09.010

Approximate string matching with address bit errors

Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat

Department of Computer Science

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

4 Scopus citations

Abstract

A string S ∈ Σ^m can be viewed as a set of pairs S = {(σ_i, i) : i ∈ {0, ..., m - 1}}. We 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 into the content itself (σ_i). In this paper, we consider the case where bits of i may be erroneously flipped, either in a consistent or transient manner. We formally define the corresponding approximate pattern matching problems, and provide efficient algorithms for their resolution, while introducing some novel techniques.

Original language	English
Pages (from-to)	5334-5346
Number of pages	13
Journal	Theoretical Computer Science
Volume	410
Issue number	51
DOIs	https://doi.org/10.1016/j.tcs.2009.09.010
State	Published - 28 Nov 2009

Bibliographical note

Funding Information:
The authors wish to thank the anonymous referees who carefully read the original manuscript and provided comments that were invaluable to the clarity of the paper. The first author was partly supported by ISF grant 35/05. The fourth author’s work is part of A. Levy’s Ph.D. thesis. The fifth author’s research supported in part by the Binational Science Foundation (BSF).

Funding

The authors wish to thank the anonymous referees who carefully read the original manuscript and provided comments that were invaluable to the clarity of the paper. The first author was partly supported by ISF grant 35/05. The fourth author’s work is part of A. Levy’s Ph.D. thesis. The fifth author’s research supported in part by the Binational Science Foundation (BSF).

Funders	Funder number
United States-Israel Binational Science Foundation
Israel Science Foundation	35/05

Keywords

Address errors
Approximate string matching
Strings rearrangement metrics

Access to Document

10.1016/j.tcs.2009.09.010

Cite this

@article{6c0d97a4f0334f82bd97dc79d4d21c42,

title = "Approximate string matching with address bit errors",

abstract = "A string S ∈ Σm can be viewed as a set of pairs S = {(σi, i) : i ∈ {0, ..., m - 1}}. We 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 into the content itself (σi). In this paper, we consider the case where bits of i may be erroneously flipped, either in a consistent or transient manner. We formally define the corresponding approximate pattern matching problems, and provide efficient algorithms for their resolution, while introducing some novel techniques.",

keywords = "Address errors, Approximate string matching, Strings rearrangement metrics",

author = "Amihood Amir and Yonatan Aumann and Oren Kapah and Avivit Levy and Ely Porat",

note = "Funding Information: The authors wish to thank the anonymous referees who carefully read the original manuscript and provided comments that were invaluable to the clarity of the paper. The first author was partly supported by ISF grant 35/05. The fourth author{\textquoteright}s work is part of A. Levy{\textquoteright}s Ph.D. thesis. The fifth author{\textquoteright}s research supported in part by the Binational Science Foundation (BSF).",

year = "2009",

month = nov,

day = "28",

doi = "10.1016/j.tcs.2009.09.010",

language = "אנגלית",

volume = "410",

pages = "5334--5346",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "51",

}

TY - JOUR

T1 - Approximate string matching with address bit errors

AU - Amir, Amihood

AU - Aumann, Yonatan

AU - Kapah, Oren

AU - Levy, Avivit

AU - Porat, Ely

N1 - Funding Information: The authors wish to thank the anonymous referees who carefully read the original manuscript and provided comments that were invaluable to the clarity of the paper. The first author was partly supported by ISF grant 35/05. The fourth author’s work is part of A. Levy’s Ph.D. thesis. The fifth author’s research supported in part by the Binational Science Foundation (BSF).

PY - 2009/11/28

Y1 - 2009/11/28

N2 - A string S ∈ Σm can be viewed as a set of pairs S = {(σi, i) : i ∈ {0, ..., m - 1}}. We 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 into the content itself (σi). In this paper, we consider the case where bits of i may be erroneously flipped, either in a consistent or transient manner. We formally define the corresponding approximate pattern matching problems, and provide efficient algorithms for their resolution, while introducing some novel techniques.

AB - A string S ∈ Σm can be viewed as a set of pairs S = {(σi, i) : i ∈ {0, ..., m - 1}}. We 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 into the content itself (σi). In this paper, we consider the case where bits of i may be erroneously flipped, either in a consistent or transient manner. We formally define the corresponding approximate pattern matching problems, and provide efficient algorithms for their resolution, while introducing some novel techniques.

KW - Address errors

KW - Approximate string matching

KW - Strings rearrangement metrics

UR - http://www.scopus.com/inward/record.url?scp=70349973435&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2009.09.010

DO - 10.1016/j.tcs.2009.09.010

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:70349973435

SN - 0304-3975

VL - 410

SP - 5334

EP - 5346

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 51

ER -

Approximate string matching with address bit errors

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this