Approximate string matching with stuck address bits
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...
Gespeichert in:
| Veröffentlicht in: | Theoretical computer science 2011-07, Vol.412 (29), p.3537-3544 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 3544 |
|---|---|
| container_issue | 29 |
| container_start_page | 3537 |
| container_title | Theoretical computer science |
| container_volume | 412 |
| creator | Amir, Amihood Eisenberg, Estrella Keller, Orgad Levy, Avivit Porat, Ely |
| description | 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. |
| doi_str_mv | 10.1016/j.tcs.2011.02.044 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671320617</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0304397511001800</els_id><sourcerecordid>1671320617</sourcerecordid><originalsourceid>FETCH-LOGICAL-c360t-2bd3d19eda2c4c6b3c6e361f6b493d64a7eefebcb15ce8bb870d16e795d9a9713</originalsourceid><addsrcrecordid>eNp9kLlOAzEQhi0EEiHwAHTbINHs4mvtWFRRxCVFooHa8jFLHDbZYDscb4-jRJRMM6PRN8f_I3RJcEMwETfLJrvUUExIg2mDOT9CIzKRqqZU8WM0wgzzminZnqKzlJa4RCvFCLHpZhOH77AyGaqUY1i_VaV2i13xFfKiNLfuvTLeR0ipsiGnc3TSmT7BxSGP0ev93cvssZ4_PzzNpvPaMYFzTa1nnijwhjruhGVOABOkE5Yr5gU3EqAD6yxpHUysnUjsiQCpWq-MkoSN0fV-b_nwYwsp61VIDvrerGHYJk1EgSgWRBaU7FEXh5QidHoTi6b4ownWO4P0UheD9M4gjakuBpWZq8N6k5zpu2jWLqS_QcqpEFKKwt3uOShaPwNEnVyAtQMfIris_RD-ufILLRd7bg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1671320617</pqid></control><display><type>article</type><title>Approximate string matching with stuck address bits</title><source>Access via ScienceDirect (Elsevier)</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Amir, Amihood ; Eisenberg, Estrella ; Keller, Orgad ; Levy, Avivit ; Porat, Ely</creator><creatorcontrib>Amir, Amihood ; Eisenberg, Estrella ; Keller, Orgad ; Levy, Avivit ; Porat, Ely</creatorcontrib><description>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.</description><identifier>ISSN: 0304-3975</identifier><identifier>EISSN: 1879-2294</identifier><identifier>DOI: 10.1016/j.tcs.2011.02.044</identifier><identifier>CODEN: TCSCDI</identifier><language>eng</language><publisher>Oxford: Elsevier B.V</publisher><subject>Address errors ; Algorithmics. Computability. Computer arithmetics ; Algorithms ; Applied sciences ; Approximate string matching ; Approximation ; Computer science; control theory; systems ; Errors ; Exact sciences and technology ; Matching ; Miscellaneous ; Pattern matching ; Position (location) ; String matching ; String rearrangement metrics ; Strings ; Theoretical computing</subject><ispartof>Theoretical computer science, 2011-07, Vol.412 (29), p.3537-3544</ispartof><rights>2011 Elsevier B.V.</rights><rights>2015 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c360t-2bd3d19eda2c4c6b3c6e361f6b493d64a7eefebcb15ce8bb870d16e795d9a9713</citedby><cites>FETCH-LOGICAL-c360t-2bd3d19eda2c4c6b3c6e361f6b493d64a7eefebcb15ce8bb870d16e795d9a9713</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.tcs.2011.02.044$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>315,781,785,3551,27926,27927,45997</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=24266776$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Amir, Amihood</creatorcontrib><creatorcontrib>Eisenberg, Estrella</creatorcontrib><creatorcontrib>Keller, Orgad</creatorcontrib><creatorcontrib>Levy, Avivit</creatorcontrib><creatorcontrib>Porat, Ely</creatorcontrib><title>Approximate string matching with stuck address bits</title><title>Theoretical computer science</title><description>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.</description><subject>Address errors</subject><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Approximate string matching</subject><subject>Approximation</subject><subject>Computer science; control theory; systems</subject><subject>Errors</subject><subject>Exact sciences and technology</subject><subject>Matching</subject><subject>Miscellaneous</subject><subject>Pattern matching</subject><subject>Position (location)</subject><subject>String matching</subject><subject>String rearrangement metrics</subject><subject>Strings</subject><subject>Theoretical computing</subject><issn>0304-3975</issn><issn>1879-2294</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNp9kLlOAzEQhi0EEiHwAHTbINHs4mvtWFRRxCVFooHa8jFLHDbZYDscb4-jRJRMM6PRN8f_I3RJcEMwETfLJrvUUExIg2mDOT9CIzKRqqZU8WM0wgzzminZnqKzlJa4RCvFCLHpZhOH77AyGaqUY1i_VaV2i13xFfKiNLfuvTLeR0ipsiGnc3TSmT7BxSGP0ev93cvssZ4_PzzNpvPaMYFzTa1nnijwhjruhGVOABOkE5Yr5gU3EqAD6yxpHUysnUjsiQCpWq-MkoSN0fV-b_nwYwsp61VIDvrerGHYJk1EgSgWRBaU7FEXh5QidHoTi6b4ownWO4P0UheD9M4gjakuBpWZq8N6k5zpu2jWLqS_QcqpEFKKwt3uOShaPwNEnVyAtQMfIris_RD-ufILLRd7bg</recordid><startdate>20110701</startdate><enddate>20110701</enddate><creator>Amir, Amihood</creator><creator>Eisenberg, Estrella</creator><creator>Keller, Orgad</creator><creator>Levy, Avivit</creator><creator>Porat, Ely</creator><general>Elsevier B.V</general><general>Elsevier</general><scope>6I.</scope><scope>AAFTH</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20110701</creationdate><title>Approximate string matching with stuck address bits</title><author>Amir, Amihood ; Eisenberg, Estrella ; Keller, Orgad ; Levy, Avivit ; Porat, Ely</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c360t-2bd3d19eda2c4c6b3c6e361f6b493d64a7eefebcb15ce8bb870d16e795d9a9713</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Address errors</topic><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Approximate string matching</topic><topic>Approximation</topic><topic>Computer science; control theory; systems</topic><topic>Errors</topic><topic>Exact sciences and technology</topic><topic>Matching</topic><topic>Miscellaneous</topic><topic>Pattern matching</topic><topic>Position (location)</topic><topic>String matching</topic><topic>String rearrangement metrics</topic><topic>Strings</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Amir, Amihood</creatorcontrib><creatorcontrib>Eisenberg, Estrella</creatorcontrib><creatorcontrib>Keller, Orgad</creatorcontrib><creatorcontrib>Levy, Avivit</creatorcontrib><creatorcontrib>Porat, Ely</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Theoretical computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Amir, Amihood</au><au>Eisenberg, Estrella</au><au>Keller, Orgad</au><au>Levy, Avivit</au><au>Porat, Ely</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Approximate string matching with stuck address bits</atitle><jtitle>Theoretical computer science</jtitle><date>2011-07-01</date><risdate>2011</risdate><volume>412</volume><issue>29</issue><spage>3537</spage><epage>3544</epage><pages>3537-3544</pages><issn>0304-3975</issn><eissn>1879-2294</eissn><coden>TCSCDI</coden><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.</abstract><cop>Oxford</cop><pub>Elsevier B.V</pub><doi>10.1016/j.tcs.2011.02.044</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0304-3975 |
| ispartof | Theoretical computer science, 2011-07, Vol.412 (29), p.3537-3544 |
| issn | 0304-3975 1879-2294 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1671320617 |
| source | Access via ScienceDirect (Elsevier); EZB-FREE-00999 freely available EZB journals |
| subjects | Address errors Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Approximate string matching Approximation Computer science control theory systems Errors Exact sciences and technology Matching Miscellaneous Pattern matching Position (location) String matching String rearrangement metrics Strings Theoretical computing |
| title | Approximate string matching with stuck address bits |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-18T11%3A01%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Approximate%20string%20matching%20with%20stuck%20address%20bits&rft.jtitle=Theoretical%20computer%20science&rft.au=Amir,%20Amihood&rft.date=2011-07-01&rft.volume=412&rft.issue=29&rft.spage=3537&rft.epage=3544&rft.pages=3537-3544&rft.issn=0304-3975&rft.eissn=1879-2294&rft.coden=TCSCDI&rft_id=info:doi/10.1016/j.tcs.2011.02.044&rft_dat=%3Cproquest_cross%3E1671320617%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1671320617&rft_id=info:pmid/&rft_els_id=S0304397511001800&rfr_iscdi=true |