Home › Entities › Academia › Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition

Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition

Research article (ACM Journal of Experimental Algorithmics, 2019) · cited 11× · AI/ML
Creative Work Academia

Facts

4 properties
Instance of
scholarly article[2]
Publication date
February 14, 2019as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
Published in
Journal of Experimental Algorithmicsas of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
Title
Linear and Efficient String Matching Algorithms Based on Weak Factor Recognitionas of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
🔖 Identifiers · 2
OpenAlex ID
W2913628247as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
DOI
10.1145/3301295as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
📚 Sources · 1

Report an error or request removal Lineage (PROV-JSON)

📜 Data licence
Source: OpenAlex (openalex.org), snapshot of 2026-09-23. CC0 1.0 Universal. CC0 1.0 Universal · OpenAlex
🔗 Connections
Authored by 1
Domenico Cantone
← Author of 1
Domenico Cantone
Press Enter · cited answer in seconds

Summary

Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition is a scholarly article[1].

Related Entities

Domenico Cantone

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition. Retrieved October 18, 2026, from https://4ort.xyz/entity/linear-and-efficient-string-matching-algorithms-based-on-weak-factor-recognition
MLA “Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition.” 4ort.xyz Knowledge Graph, 4ort.xyz, 18 Oct. 2026, https://4ort.xyz/entity/linear-and-efficient-string-matching-algorithms-based-on-weak-factor-recognition.
BibTeX @misc{4ortxyz_linear-and-efficient-string-matching-algorithms-based-on-weak-factor-recognition_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition}}, year = {2026}, url = {https://4ort.xyz/entity/linear-and-efficient-string-matching-algorithms-based-on-weak-factor-recognition}, note = {Accessed: 2026-10-18}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition — https://4ort.xyz/entity/linear-and-efficient-string-matching-algorithms-based-on-weak-factor-recognition (retrieved 2026-10-18)

Canonical URL: https://4ort.xyz/entity/linear-and-efficient-string-matching-algorithms-based-on-weak-factor-recognition · Last refreshed: