A simple grammar-based index for finding approximately longest common substrings.
- DOI
- 10.1007/978-3-031-43980-3_19
- Published
- 2023
- Container
- International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium)
- Publisher
- Not recorded
- Open access
- yes
Credibility signals
limited evidence Score 45/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.
Show all credibility signals
- cautionDOI registered: No matching Crossref record was present in this response.
- cautionDOI resolves: No matching Crossref record was present in this response.
- not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- supportingOpen access status: Normalized open-access status: open.
- not scoredPublication license: Not checked or no result supplied; no credibility inference made.
- not scoredPublication version: A publication version was supplied but is not scored.
- cautionMetadata completeness: 5 of 6 scored descriptive metadata groups are present; missing fields increase uncertainty.
Cite this work
BibTeX
@article{allodium:10.1007/978-3-031-43980-3_19,
title = {A simple grammar-based index for finding approximately longest common substrings.},
author = {Gagie T and Kashgouli S and Navarro G},
year = {2023},
journal = {International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium)},
doi = {10.1007/978-3-031-43980-3_19},
url = {https://doi.org/10.1007/978-3-031-43980-3_19}
}RIS
TY - JOUR TI - A simple grammar-based index for finding approximately longest common substrings. AU - Gagie T AU - Kashgouli S AU - Navarro G PY - 2023 JO - International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium) DO - 10.1007/978-3-031-43980-3_19 UR - https://doi.org/10.1007/978-3-031-43980-3_19 ER -
APA
T, G., S, K., & G, N. (2023). A simple grammar-based index for finding approximately longest common substrings.. International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium). https://doi.org/10.1007/978-3-031-43980-3_19
Source records
- pubmed · retrieved 2026-09-25T07:25:17.171Z