Approximate string matching with address bit errors

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

doi:10.1007/978-3-540-69068-9_13

Approximate string matching with address bit errors

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

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

17 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 to 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
Title of host publication	Combinatorial Pattern Matching - 19th Annual Symposium, CPM 2008, Proceedings
Pages	118-129
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-540-69068-9_13
State	Published - 2008
Event	19th Annual Symposium on Combinatorial Pattern Matching, CPM 2008 - Pisa, Italy Duration: 18 Jun 2008 → 20 Jun 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5029 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	19th Annual Symposium on Combinatorial Pattern Matching, CPM 2008
Country/Territory	Italy
City	Pisa
Period	18/06/08 → 20/06/08

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
Iowa Science Foundation	35/05
United States-Israel Binational Science Foundation

Access to Document

10.1007/978-3-540-69068-9_13

Cite this

Amir, A., Aumann, Y., Kapah, O., Levy, A., & Porat, E. (2008). Approximate string matching with address bit errors. In Combinatorial Pattern Matching - 19th Annual Symposium, CPM 2008, Proceedings (pp. 118-129). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5029 LNCS). https://doi.org/10.1007/978-3-540-69068-9_13

@inproceedings{046d1568a06445a39db24303fa5b4c86,

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 to 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.",

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).; 19th Annual Symposium on Combinatorial Pattern Matching, CPM 2008 ; Conference date: 18-06-2008 Through 20-06-2008",

year = "2008",

doi = "10.1007/978-3-540-69068-9_13",

language = "אנגלית",

isbn = "3540690662",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "118--129",

booktitle = "Combinatorial Pattern Matching - 19th Annual Symposium, CPM 2008, Proceedings",

}

Amir, A, Aumann, Y, Kapah, O, Levy, A & Porat, E 2008, Approximate string matching with address bit errors. in Combinatorial Pattern Matching - 19th Annual Symposium, CPM 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5029 LNCS, pp. 118-129, 19th Annual Symposium on Combinatorial Pattern Matching, CPM 2008, Pisa, Italy, 18/06/08. https://doi.org/10.1007/978-3-540-69068-9_13

Approximate string matching with address bit errors. / Amir, Amihood; Aumann, Yonatan; Kapah, Oren et al.
Combinatorial Pattern Matching - 19th Annual Symposium, CPM 2008, Proceedings. 2008. p. 118-129 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5029 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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 - 2008

Y1 - 2008

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 to 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 to 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.

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

U2 - 10.1007/978-3-540-69068-9_13

DO - 10.1007/978-3-540-69068-9_13

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:45849083524

SN - 3540690662

SN - 9783540690665

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 118

EP - 129

BT - Combinatorial Pattern Matching - 19th Annual Symposium, CPM 2008, Proceedings

T2 - 19th Annual Symposium on Combinatorial Pattern Matching, CPM 2008

Y2 - 18 June 2008 through 20 June 2008

ER -

Approximate string matching with address bit errors

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this