Loading…
Deterministic Sparse Suffix Sorting in the Restore Model
Given a text T of length n , we propose a deterministic online algorithm computing the sparse suffix array and the sparse longest common prefix array of T in O( c √ lg n + m lg m lg n lg * n ) time with O( m ) words of space under the premise that the space of T is rewritable, where m ≤ n is the nu...
Saved in:
| Published in: | ACM transactions on algorithms 2020-09, Vol.16 (4), p.1-53 |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Citations: | Items that this one cites Items that cite this one |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| cited_by | cdi_FETCH-LOGICAL-c291t-8fcd0a5dc5339926787ecfcba6e5b42512818fb141ce856763ed316b763ca4a73 |
|---|---|
| cites | cdi_FETCH-LOGICAL-c291t-8fcd0a5dc5339926787ecfcba6e5b42512818fb141ce856763ed316b763ca4a73 |
| container_end_page | 53 |
| container_issue | 4 |
| container_start_page | 1 |
| container_title | ACM transactions on algorithms |
| container_volume | 16 |
| creator | Fischer, Johannes I, Tomohiro Köppl, Dominik |
| description | Given a text
T
of length
n
, we propose a deterministic online algorithm computing the sparse suffix array and the sparse longest common prefix array of
T
in O(
c
√ lg
n
+
m
lg
m
lg
n
lg
*
n
) time with O(
m
) words of space under the premise that the space of
T
is rewritable, where
m
≤
n
is the number of suffixes to be sorted (provided online and arbitrarily), and
c
is the number of characters with
m
≤
c
≤
n
that must be compared for distinguishing the designated suffixes. |
| doi_str_mv | 10.1145/3398681 |
| format | article |
| fullrecord | <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1145_3398681</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1145_3398681</sourcerecordid><originalsourceid>FETCH-LOGICAL-c291t-8fcd0a5dc5339926787ecfcba6e5b42512818fb141ce856763ed316b763ca4a73</originalsourceid><addsrcrecordid>eNo9j8FKAzEURYMoWKv4C9m5Gp2Xl2SSpVStQkVwdD1kMi8aaWdKEkH_3orF1T2ryzmMnUN9CSDVFaI12sABm4GSttKIePjPQh2zk5w_6hotopkxc0OF0iaOMZfoebt1KRNvP0OIX7ydUonjG48jL-_EnymXKRF_nAZan7Kj4NaZzvY7Z693ty-L-2r1tHxYXK8qLyyUygQ_1E4NXu28rNCNacgH3ztNqpdCgTBgQg8SPBmlG400IOh-B95J1-CcXfz9-jTlnCh02xQ3Ln13UHe_wd0-GH8AXzNG_Q</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Deterministic Sparse Suffix Sorting in the Restore Model</title><source>Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)</source><creator>Fischer, Johannes ; I, Tomohiro ; Köppl, Dominik</creator><creatorcontrib>Fischer, Johannes ; I, Tomohiro ; Köppl, Dominik</creatorcontrib><description>Given a text
T
of length
n
, we propose a deterministic online algorithm computing the sparse suffix array and the sparse longest common prefix array of
T
in O(
c
√ lg
n
+
m
lg
m
lg
n
lg
*
n
) time with O(
m
) words of space under the premise that the space of
T
is rewritable, where
m
≤
n
is the number of suffixes to be sorted (provided online and arbitrarily), and
c
is the number of characters with
m
≤
c
≤
n
that must be compared for distinguishing the designated suffixes.</description><identifier>ISSN: 1549-6325</identifier><identifier>EISSN: 1549-6333</identifier><identifier>DOI: 10.1145/3398681</identifier><language>eng</language><ispartof>ACM transactions on algorithms, 2020-09, Vol.16 (4), p.1-53</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c291t-8fcd0a5dc5339926787ecfcba6e5b42512818fb141ce856763ed316b763ca4a73</citedby><cites>FETCH-LOGICAL-c291t-8fcd0a5dc5339926787ecfcba6e5b42512818fb141ce856763ed316b763ca4a73</cites><orcidid>0000-0002-8721-4444</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Fischer, Johannes</creatorcontrib><creatorcontrib>I, Tomohiro</creatorcontrib><creatorcontrib>Köppl, Dominik</creatorcontrib><title>Deterministic Sparse Suffix Sorting in the Restore Model</title><title>ACM transactions on algorithms</title><description>Given a text
T
of length
n
, we propose a deterministic online algorithm computing the sparse suffix array and the sparse longest common prefix array of
T
in O(
c
√ lg
n
+
m
lg
m
lg
n
lg
*
n
) time with O(
m
) words of space under the premise that the space of
T
is rewritable, where
m
≤
n
is the number of suffixes to be sorted (provided online and arbitrarily), and
c
is the number of characters with
m
≤
c
≤
n
that must be compared for distinguishing the designated suffixes.</description><issn>1549-6325</issn><issn>1549-6333</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNo9j8FKAzEURYMoWKv4C9m5Gp2Xl2SSpVStQkVwdD1kMi8aaWdKEkH_3orF1T2ryzmMnUN9CSDVFaI12sABm4GSttKIePjPQh2zk5w_6hotopkxc0OF0iaOMZfoebt1KRNvP0OIX7ydUonjG48jL-_EnymXKRF_nAZan7Kj4NaZzvY7Z693ty-L-2r1tHxYXK8qLyyUygQ_1E4NXu28rNCNacgH3ztNqpdCgTBgQg8SPBmlG400IOh-B95J1-CcXfz9-jTlnCh02xQ3Ln13UHe_wd0-GH8AXzNG_Q</recordid><startdate>20200901</startdate><enddate>20200901</enddate><creator>Fischer, Johannes</creator><creator>I, Tomohiro</creator><creator>Köppl, Dominik</creator><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0002-8721-4444</orcidid></search><sort><creationdate>20200901</creationdate><title>Deterministic Sparse Suffix Sorting in the Restore Model</title><author>Fischer, Johannes ; I, Tomohiro ; Köppl, Dominik</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c291t-8fcd0a5dc5339926787ecfcba6e5b42512818fb141ce856763ed316b763ca4a73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Fischer, Johannes</creatorcontrib><creatorcontrib>I, Tomohiro</creatorcontrib><creatorcontrib>Köppl, Dominik</creatorcontrib><collection>CrossRef</collection><jtitle>ACM transactions on algorithms</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Fischer, Johannes</au><au>I, Tomohiro</au><au>Köppl, Dominik</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Deterministic Sparse Suffix Sorting in the Restore Model</atitle><jtitle>ACM transactions on algorithms</jtitle><date>2020-09-01</date><risdate>2020</risdate><volume>16</volume><issue>4</issue><spage>1</spage><epage>53</epage><pages>1-53</pages><issn>1549-6325</issn><eissn>1549-6333</eissn><abstract>Given a text
T
of length
n
, we propose a deterministic online algorithm computing the sparse suffix array and the sparse longest common prefix array of
T
in O(
c
√ lg
n
+
m
lg
m
lg
n
lg
*
n
) time with O(
m
) words of space under the premise that the space of
T
is rewritable, where
m
≤
n
is the number of suffixes to be sorted (provided online and arbitrarily), and
c
is the number of characters with
m
≤
c
≤
n
that must be compared for distinguishing the designated suffixes.</abstract><doi>10.1145/3398681</doi><tpages>53</tpages><orcidid>https://orcid.org/0000-0002-8721-4444</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1549-6325 |
| ispartof | ACM transactions on algorithms, 2020-09, Vol.16 (4), p.1-53 |
| issn | 1549-6325 1549-6333 |
| language | eng |
| recordid | cdi_crossref_primary_10_1145_3398681 |
| source | Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list) |
| title | Deterministic Sparse Suffix Sorting in the Restore Model |
| url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T21%3A22%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Deterministic%20Sparse%20Suffix%20Sorting%20in%20the%20Restore%20Model&rft.jtitle=ACM%20transactions%20on%20algorithms&rft.au=Fischer,%20Johannes&rft.date=2020-09-01&rft.volume=16&rft.issue=4&rft.spage=1&rft.epage=53&rft.pages=1-53&rft.issn=1549-6325&rft.eissn=1549-6333&rft_id=info:doi/10.1145/3398681&rft_dat=%3Ccrossref%3E10_1145_3398681%3C/crossref%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c291t-8fcd0a5dc5339926787ecfcba6e5b42512818fb141ce856763ed316b763ca4a73%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |