Monotonic run length text sampling and fake sampled positions
Clicks: 10
ID: 322390
2026
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
0.0
/100
10 views
0 readers
AI Quality Assessment
Not analyzed
Readership in this journal
Ranked #13 of 36 articles by views in The Computer Journal
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Abstract Text-sampling is an efficient approach for string matching problems introduced in order to overcome the prohibitive space requirements of indexed matching, on the one hand, and drastically reduce searching time for the online solutions, on the other hand. Known solutions to sampled string matching are very efficient in practical cases being able to improve standard online string matching algorithms up to $99.6$% using in the best cases $<1$% of the original text size when applied to natural languages combined with the condensed alphabet. In this paper we present our results obtained in an attempt to extend sampled-string matching to the general case of nonclassical string matching. Specifically, we introduce a new sampling approach that turns out to be suitable for both exact and nonclassical matching and evaluate it in the context of two specific cases of nonclassical matching, the order-preserving pattern matching problem and the Cartesian tree pattern matching problem. Our experimental results show that the new approach is extremely competitive both in terms of space and running time, and for both classical and nonclassical matching. We also discuss the applicability of the new approach to other different nonclassical string matching problems.
| Reference Key |
openalex_W7170192723
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Simone Faro, Thierry Lecroq, Francesco Pio Marino, Arianna Pavone, Antonio Scardace |
| Journal | The Computer Journal |
| Year | 2026 |
| DOI |
10.1093/comjnl/bxag075
|
| URL | |
| Keywords | Keywords not found |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.