Space-Efficient SLP Encoding for O(log N)-Time Random Access
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN: 1611-3349, Vol: 14899 LNCS, Page: 336-347
2025
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Conference Paper Description
A Straight-Line Program (SLP) G for a string T is a context-free grammar (CFG) that derives T only, which can be considered as a compressed representation of T.In this paper, we show how to encode G in n⌈lgN⌉+(n+n)⌈lg(n+σ)⌉+4n-2n+o(n) bits to support random access queries of extracting T[p..q] in worst-case O(logN+q-p) time, where N is the length of T, σ is the alphabet size, n is the number of variables in G and n≤n is the number of symmetric centroid paths in the DAG representation for G.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85205343242&origin=inward; http://dx.doi.org/10.1007/978-3-031-72200-4_25; https://link.springer.com/10.1007/978-3-031-72200-4_25; https://dx.doi.org/10.1007/978-3-031-72200-4_25; https://link.springer.com/chapter/10.1007/978-3-031-72200-4_25
Springer Science and Business Media LLC
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know