Pilot corpus: NIH-funded biomedical datasets. Any DOI can be scored on demand — network effects sharpen as coverage grows.

Efficient Online String Matching Based on Characters Distance Text Sampling

Algorithmica(2020)10.1007/s00453-020-00732-4Source: DataRank Database

Efficient Online String Matching Based on Characters Distance Text Sampling is a research paper published in Algorithmica (2020). On theSindex it has a DataRank of 0.312. It has been cited 7 times.

N/A

0.312DataRank · unranked

Scored on demand from live citation data

7 citations

Download PDF

Cite:

Linked data & code

DataRank reads this dataset's downstream impact straight off the citation graph — no black box, no proprietary weighting. How is this computed?

›Methodology & internals

datarank_citation_only_1hop_v6· scope data_onlyMethodology

Pipeline:MetadataData-paper checkEnrichmentCitation networkScoring

Enrichment:Impact (FWCI 0.00)OA: greenTopics (22)Linked Datasets (2)DataCite Reuse (2)IDs (PubMed, OpenAlex)SDGs (1)

FAIR Checklist

Context only (not used in score)

Findable (2/2)

Has DOI
Indexed in repositories

Accessible (0/2)

Interoperable (2/2)

DataCite relations
Linked datasets

Reusable (0/3)

FAIR checklist signals are shown for context only and do not affect DataRank scoring.

Run a calibrated FAIR evaluation for this paper →

We only score data papers we can read in full — never from an abstract alone.

DataRank Breakdown

Base Score 100%Citation Network 0%

Base Score Contribution

0.312

From this paper's citation signal

Citation Network Contribution

Citation network not refreshed for this result

This paper's DataRank is currently driven only by its base citation score. Citation network data was not refreshed for this result.

Learn more about DataRank methodology →

Authors (3)

Francesco Pio Marino,Arianna Pavone,Simone Faro ORCID

Live enrichment

PubMed:21097893 OpenAlex:https://openalex.org/W2969146739

FWCI

0.00

Citation Percentile

0.0%

greenLicense: https://www.springer.com/tdm

repositoryhttps://arxiv.org/pdf/1908.05930

publisherhttps://link.springer.com/content/pdf/10.1007/s00453-020-00732-4.pdf

publisherhttps://link.springer.com/article/10.1007/s00453-020-00732-4/fulltext.html

repositoryhttp://arxiv.org/abs/1908.05930

Fields of Study

Algorithms and Data CompressionNetwork Packet Processing and OptimizationDNA and Biological Computing

Keywords

String searching algorithmPoint (geometry)Matching (statistics)Computer scienceString (physics)Sampling (signal processing)Character (mathematics)Time complexityTheoretical computer scienceSpace (punctuation)AlgorithmSample (material)SpacetimeOrder (exchange)Pattern matchingMathematicsArtificial intelligenceComputer visionStatistics

Sustainable Development Goals

SDG 0: Quality Education

A Bitwise Approach to SCER Matching in Indeterminate Strings

10.4230/lipics.cpm.2026.21Schloss Dagstuhl – Leibniz-Zentrum für Informatik

The Great Textual Hoax: Boosting Sampled String Matching with Fake Samples

10.4230/lipics.fun.2024.13Schloss Dagstuhl – Leibniz-Zentrum für Informatik