Improved algorithms for the range next value problem and applications
The Range Next Value problem (problem RNV) is a recent interesting variant of the range search problems, where the query is for the immediate next (or equal) value of a given number within a given interval of an array. Problem RNV was introduced and studied very recently by Crochemore et al. [Maxime...
Gespeichert in:
| Veröffentlicht in: | Theoretical computer science 2012-05, Vol.434, p.23-34 |
|---|---|
| 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 | 34 |
|---|---|
| container_issue | |
| container_start_page | 23 |
| container_title | Theoretical computer science |
| container_volume | 434 |
| creator | Crochemore, Maxime Iliopoulos, Costas S. Kubica, Marcin Rahman, M. Sohel Tischler, German Waleń, Tomasz |
| description | The Range Next Value problem (problem RNV) is a recent interesting variant of the range search problems, where the query is for the immediate next (or equal) value of a given number within a given interval of an array. Problem RNV was introduced and studied very recently by Crochemore et al. [Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman, Finding patterns in given intervals, in: Antonin Kucera, Ludek Kucera (Eds.), MFCS, 22 in: Lecture Notes in Computer Science, vol. 4708, Springer, 2007, pp. 645–656]. In this paper, we present improved algorithms for problem RNV and algorithms for extended versions of the RNV problem. We also show how this problem can be used to achieve optimal query time for a number of interesting variants of the classic pattern matching problems. |
| doi_str_mv | 10.1016/j.tcs.2012.02.015 |
| format | Article |
| fullrecord | <record><control><sourceid>hal_cross</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_00837004v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0304397512001569</els_id><sourcerecordid>oai_HAL_hal_00837004v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-c374t-a1cf1d91539abb659f8fa5ad18a448919fed4f47d147196eeb1bdba39fafc6aa3</originalsourceid><addsrcrecordid>eNp9kE1LAzEQhoMoWKs_wFuuHnbN7GY_gqdSqhYKXvQcZvPRpuwXybrovzel4tHhhYHheYeZl5B7YCkwKB-P6aRCmjHIUhYFxQVZQF2JJMsEvyQLljOe5KIqrslNCEcWq6jKBdlsu9EPs9EU2_3g3XToArWDp9PBUI_93tDefE10xvbT0Ig2reko9pEfx9YpnNzQh1tyZbEN5u63L8nH8-Z9_Zrs3l6269UuUXnFpwRBWdACilxg05SFsLXFAjXUyHktQFijueWVBl6BKI1poNEN5sKiVSViviQP570HbOXoXYf-Ww7o5OtqJ08zxuq8YozPEFk4s8oPIXhj_wzA5CkzeZQxM3nKTLKoeNaSPJ09Jj4xO-NlUM70ymjnjZqkHtw_7h9itXVj</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Improved algorithms for the range next value problem and applications</title><source>Access via ScienceDirect (Elsevier)</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Crochemore, Maxime ; Iliopoulos, Costas S. ; Kubica, Marcin ; Rahman, M. Sohel ; Tischler, German ; Waleń, Tomasz</creator><creatorcontrib>Crochemore, Maxime ; Iliopoulos, Costas S. ; Kubica, Marcin ; Rahman, M. Sohel ; Tischler, German ; Waleń, Tomasz</creatorcontrib><description>The Range Next Value problem (problem RNV) is a recent interesting variant of the range search problems, where the query is for the immediate next (or equal) value of a given number within a given interval of an array. Problem RNV was introduced and studied very recently by Crochemore et al. [Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman, Finding patterns in given intervals, in: Antonin Kucera, Ludek Kucera (Eds.), MFCS, 22 in: Lecture Notes in Computer Science, vol. 4708, Springer, 2007, pp. 645–656]. In this paper, we present improved algorithms for problem RNV and algorithms for extended versions of the RNV problem. We also show how this problem can be used to achieve optimal query time for a number of interesting variants of the classic pattern matching problems.</description><identifier>ISSN: 0304-3975</identifier><identifier>EISSN: 1879-2294</identifier><identifier>DOI: 10.1016/j.tcs.2012.02.015</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Algorithms ; Computer Science ; Data structures ; Data Structures and Algorithms ; Range search problems</subject><ispartof>Theoretical computer science, 2012-05, Vol.434, p.23-34</ispartof><rights>2012 Elsevier B.V.</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c374t-a1cf1d91539abb659f8fa5ad18a448919fed4f47d147196eeb1bdba39fafc6aa3</citedby><cites>FETCH-LOGICAL-c374t-a1cf1d91539abb659f8fa5ad18a448919fed4f47d147196eeb1bdba39fafc6aa3</cites><orcidid>0000-0003-1087-1419</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.tcs.2012.02.015$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>230,314,780,784,885,3550,27924,27925,45995</link.rule.ids><backlink>$$Uhttps://hal.science/hal-00837004$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Crochemore, Maxime</creatorcontrib><creatorcontrib>Iliopoulos, Costas S.</creatorcontrib><creatorcontrib>Kubica, Marcin</creatorcontrib><creatorcontrib>Rahman, M. Sohel</creatorcontrib><creatorcontrib>Tischler, German</creatorcontrib><creatorcontrib>Waleń, Tomasz</creatorcontrib><title>Improved algorithms for the range next value problem and applications</title><title>Theoretical computer science</title><description>The Range Next Value problem (problem RNV) is a recent interesting variant of the range search problems, where the query is for the immediate next (or equal) value of a given number within a given interval of an array. Problem RNV was introduced and studied very recently by Crochemore et al. [Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman, Finding patterns in given intervals, in: Antonin Kucera, Ludek Kucera (Eds.), MFCS, 22 in: Lecture Notes in Computer Science, vol. 4708, Springer, 2007, pp. 645–656]. In this paper, we present improved algorithms for problem RNV and algorithms for extended versions of the RNV problem. We also show how this problem can be used to achieve optimal query time for a number of interesting variants of the classic pattern matching problems.</description><subject>Algorithms</subject><subject>Computer Science</subject><subject>Data structures</subject><subject>Data Structures and Algorithms</subject><subject>Range search problems</subject><issn>0304-3975</issn><issn>1879-2294</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LAzEQhoMoWKs_wFuuHnbN7GY_gqdSqhYKXvQcZvPRpuwXybrovzel4tHhhYHheYeZl5B7YCkwKB-P6aRCmjHIUhYFxQVZQF2JJMsEvyQLljOe5KIqrslNCEcWq6jKBdlsu9EPs9EU2_3g3XToArWDp9PBUI_93tDefE10xvbT0Ig2reko9pEfx9YpnNzQh1tyZbEN5u63L8nH8-Z9_Zrs3l6269UuUXnFpwRBWdACilxg05SFsLXFAjXUyHktQFijueWVBl6BKI1poNEN5sKiVSViviQP570HbOXoXYf-Ww7o5OtqJ08zxuq8YozPEFk4s8oPIXhj_wzA5CkzeZQxM3nKTLKoeNaSPJ09Jj4xO-NlUM70ymjnjZqkHtw_7h9itXVj</recordid><startdate>20120525</startdate><enddate>20120525</enddate><creator>Crochemore, Maxime</creator><creator>Iliopoulos, Costas S.</creator><creator>Kubica, Marcin</creator><creator>Rahman, M. Sohel</creator><creator>Tischler, German</creator><creator>Waleń, Tomasz</creator><general>Elsevier B.V</general><general>Elsevier</general><scope>6I.</scope><scope>AAFTH</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>1XC</scope><orcidid>https://orcid.org/0000-0003-1087-1419</orcidid></search><sort><creationdate>20120525</creationdate><title>Improved algorithms for the range next value problem and applications</title><author>Crochemore, Maxime ; Iliopoulos, Costas S. ; Kubica, Marcin ; Rahman, M. Sohel ; Tischler, German ; Waleń, Tomasz</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c374t-a1cf1d91539abb659f8fa5ad18a448919fed4f47d147196eeb1bdba39fafc6aa3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Algorithms</topic><topic>Computer Science</topic><topic>Data structures</topic><topic>Data Structures and Algorithms</topic><topic>Range search problems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Crochemore, Maxime</creatorcontrib><creatorcontrib>Iliopoulos, Costas S.</creatorcontrib><creatorcontrib>Kubica, Marcin</creatorcontrib><creatorcontrib>Rahman, M. Sohel</creatorcontrib><creatorcontrib>Tischler, German</creatorcontrib><creatorcontrib>Waleń, Tomasz</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>CrossRef</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>Theoretical computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Crochemore, Maxime</au><au>Iliopoulos, Costas S.</au><au>Kubica, Marcin</au><au>Rahman, M. Sohel</au><au>Tischler, German</au><au>Waleń, Tomasz</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Improved algorithms for the range next value problem and applications</atitle><jtitle>Theoretical computer science</jtitle><date>2012-05-25</date><risdate>2012</risdate><volume>434</volume><spage>23</spage><epage>34</epage><pages>23-34</pages><issn>0304-3975</issn><eissn>1879-2294</eissn><abstract>The Range Next Value problem (problem RNV) is a recent interesting variant of the range search problems, where the query is for the immediate next (or equal) value of a given number within a given interval of an array. Problem RNV was introduced and studied very recently by Crochemore et al. [Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman, Finding patterns in given intervals, in: Antonin Kucera, Ludek Kucera (Eds.), MFCS, 22 in: Lecture Notes in Computer Science, vol. 4708, Springer, 2007, pp. 645–656]. In this paper, we present improved algorithms for problem RNV and algorithms for extended versions of the RNV problem. We also show how this problem can be used to achieve optimal query time for a number of interesting variants of the classic pattern matching problems.</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.tcs.2012.02.015</doi><tpages>12</tpages><orcidid>https://orcid.org/0000-0003-1087-1419</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0304-3975 |
| ispartof | Theoretical computer science, 2012-05, Vol.434, p.23-34 |
| issn | 0304-3975 1879-2294 |
| language | eng |
| recordid | cdi_hal_primary_oai_HAL_hal_00837004v1 |
| source | Access via ScienceDirect (Elsevier); EZB-FREE-00999 freely available EZB journals |
| subjects | Algorithms Computer Science Data structures Data Structures and Algorithms Range search problems |
| title | Improved algorithms for the range next value problem and applications |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-23T03%3A54%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Improved%20algorithms%20for%20the%20range%20next%20value%20problem%20and%20applications&rft.jtitle=Theoretical%20computer%20science&rft.au=Crochemore,%20Maxime&rft.date=2012-05-25&rft.volume=434&rft.spage=23&rft.epage=34&rft.pages=23-34&rft.issn=0304-3975&rft.eissn=1879-2294&rft_id=info:doi/10.1016/j.tcs.2012.02.015&rft_dat=%3Chal_cross%3Eoai_HAL_hal_00837004v1%3C/hal_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_els_id=S0304397512001569&rfr_iscdi=true |