The DOI matches its Crossref record.
Efficient Data Structures for the Factor Periodicity Problem
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Note that a basic factor w [ i..i +2 k -1] occurs either at most twice in any factor w [ j..j +2 k +1 -1] or the occurrences of w [ i..i +2 k -1] in w [ j..j +2 k +1 -1] form a run of period per ( w [ i..i +2 k -1])”
From Longest Gapped Repeats and Palindromes (2017) · cites this paper as Kociumaka et al. (2012)
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 9
- Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press (2007) · DOI · Paper page
- Crochemore, M., Iliopoulos, C., Kubica, M., Radoszewski, J., Rytter, W., Waleń, T.: Extracting Powers and Periods in a String from Its Runs Structure. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 258–269. Springer, Heidelberg (2010) · doi:10.1007/978-3-642-16321-0_27
- Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific (2003) · DOI
- Farach, M.: Optimal suffix tree construction with large alphabets. In: FOCS, pp. 137–143. IEEE Computer Society (1997) · DOI · Paper page
- Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proceedings of the American Mathematical Society 16, 109–114 (1965) · doi:10.1090/s0002-9939-1965-0174934-9
- Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press (1997) · DOI · Paper page
- Karhumäki, J., Lifshits, Y., Rytter, W.: Tiling periodicity. Discrete Mathematics & Theoretical Computer Science 12(2), 237–248 (2010)
- Kopelowitz, T., Lewenstein, M.: Dynamic weighted ancestors. In: Bansal, N., Pruhs, K., Stein, C. (eds.) SODA, pp. 565–574. SIAM (2007)
- Nekrich, Y., Navarro, G.: Sorted Range Reporting. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 271–282. Springer, Heidelberg (2012) · doi:10.1007/978-3-642-31155-0_24
Cited by
Longest Gapped Repeats and Palindromes
Dumitran, M., Gawrychowski, P., & Manea, F. (2017) · Discrete Mathematics & Theoretical Computer Science · doi:10.23638/dmtcs-19-4-4 · Cited by 11
Metadata
- Authors
- Kociumaka, T., Radoszewski, J., Rytter, W., & Waleń, T.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2012
- Pages
- 284-294
- ISSN
- 0302-9743
- 1611-3349
- Cited by
- 11
- References
- 0
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient Data Structures for the Factor Periodicity Problem. https://app.cochat.ai/papers/10.1007/978-3-642-34109-0_30
- The paper
- Kociumaka, T., Radoszewski, J., Rytter, W., & Waleń, T. (2012). Efficient Data Structures for the Factor Periodicity Problem. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-34109-0_30
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.