Approximate string matching with stuck address bits

Amihood Amir; Estrella Eisenberg; Orgad Keller; Avivit Levy; Ely Porat

doi:10.1007/978-3-642-16321-0_41

Approximate string matching with stuck address bits

Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat

Department of Computer Science

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

1 Scopus citations

Abstract

A string S ∈ ∑^m can be viewed as a set of pairs {(s_i, i) | s_i ∈ S, i ∈ {0,..., 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.

Original language	English
Title of host publication	String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings
Pages	395-405
Number of pages	11
DOIs	https://doi.org/10.1007/978-3-642-16321-0_41
State	Published - 2010
Event	17th International Symposium on String Processing and Information Retrieval, SPIRE 2010 - Los Cabos, Mexico Duration: 11 Oct 2010 → 13 Oct 2010

Publication series

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

Conference

Conference	17th International Symposium on String Processing and Information Retrieval, SPIRE 2010
Country/Territory	Mexico
City	Los Cabos
Period	11/10/10 → 13/10/10

Bibliographical note

Funding Information:
The first author is supported by NSF grant CCR-09-04581, ISF grant 347/09, and BSF grant 2008217. The fifth author’s work was supported by ISF, BSF and Google award.

Funding

The first author is supported by NSF grant CCR-09-04581, ISF grant 347/09, and BSF grant 2008217. The fifth author’s work was supported by ISF, BSF and Google award.

Funders	Funder number
National Science Foundation	CCR-09-04581
Bloom's Syndrome Foundation	2008217
Google
Iowa Science Foundation	347/09

Access to Document

10.1007/978-3-642-16321-0_41

Cite this

Amir, A., Eisenberg, E., Keller, O., Levy, A., & Porat, E. (2010). Approximate string matching with stuck address bits. In String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings (pp. 395-405). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6393 LNCS). https://doi.org/10.1007/978-3-642-16321-0_41

@inproceedings{f723766f27294f7b98c52fda45c4da8f,

title = "Approximate string matching with stuck address bits",

abstract = "A string S ∈ ∑m can be viewed as a set of pairs {(si, i) | si ∈ S, i ∈ {0,..., 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 (si ). 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.",

author = "Amihood Amir and Estrella Eisenberg and Orgad Keller and Avivit Levy and Ely Porat",

note = "Funding Information: The first author is supported by NSF grant CCR-09-04581, ISF grant 347/09, and BSF grant 2008217. The fifth author{\textquoteright}s work was supported by ISF, BSF and Google award.; 17th International Symposium on String Processing and Information Retrieval, SPIRE 2010 ; Conference date: 11-10-2010 Through 13-10-2010",

year = "2010",

doi = "10.1007/978-3-642-16321-0_41",

language = "אנגלית",

isbn = "3642163203",

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

pages = "395--405",

booktitle = "String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings",

}

Amir, A, Eisenberg, E, Keller, O, Levy, A & Porat, E 2010, Approximate string matching with stuck address bits. in String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6393 LNCS, pp. 395-405, 17th International Symposium on String Processing and Information Retrieval, SPIRE 2010, Los Cabos, Mexico, 11/10/10. https://doi.org/10.1007/978-3-642-16321-0_41

Approximate string matching with stuck address bits. / Amir, Amihood; Eisenberg, Estrella; Keller, Orgad et al.
String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings. 2010. p. 395-405 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6393 LNCS).

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

TY - GEN

T1 - Approximate string matching with stuck address bits

AU - Amir, Amihood

AU - Eisenberg, Estrella

AU - Keller, Orgad

AU - Levy, Avivit

AU - Porat, Ely

N1 - Funding Information: The first author is supported by NSF grant CCR-09-04581, ISF grant 347/09, and BSF grant 2008217. The fifth author’s work was supported by ISF, BSF and Google award.

PY - 2010

Y1 - 2010

N2 - A string S ∈ ∑m can be viewed as a set of pairs {(si, i) | si ∈ S, i ∈ {0,..., 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 (si ). 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.

AB - A string S ∈ ∑m can be viewed as a set of pairs {(si, i) | si ∈ S, i ∈ {0,..., 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 (si ). 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.

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

U2 - 10.1007/978-3-642-16321-0_41

DO - 10.1007/978-3-642-16321-0_41

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

AN - SCOPUS:78449275849

SN - 3642163203

SN - 9783642163203

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

SP - 395

EP - 405

BT - String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings

T2 - 17th International Symposium on String Processing and Information Retrieval, SPIRE 2010

Y2 - 11 October 2010 through 13 October 2010

ER -

Amir A, Eisenberg E, Keller O, Levy A, Porat E. Approximate string matching with stuck address bits. In String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings. 2010. p. 395-405. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-16321-0_41

Approximate string matching with stuck address bits

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this