⌘+K

Pulse Explore Communities Researchers Journals

Home Communities Explore

April 1, 2026Theory of Computing SystemsOpen Access

On Strings Having the Same Length-k Substrings

Giulia Bernardini Alessio Conte Estéban Gabory Roberto Grossi Grigorios Loukides Solon P. Pissis Giulia Punzi Michelle Sweering

View Full Paper

Ask AI

Bookmark

Share

Key Points

The aim is to identify the shortest distinct strings that share the same length-k substrings.
Defined a set of length-k substrings for a given string.
Formulated the problem of finding z shortest distinct strings.
Analyzed equivalency conditions based on substring matching.
Identified distinct strings that generate the same length-k substring set.
Observed patterns in substring repetition and uniqueness.
Demonstrated the efficiency of the proposed equivalency identification approach.

No abstract yet

We only have this paper's title and publication details.

Read it at the source→

Implication

This analysis examines distinct strings forming equivalent substring sets, indicating novel string relationships.

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Bernardini et al. (2026) studied this question.

synapsesocial.com/papers/69cf5dc55a333a821460bc54 https://doi.org/10.1007/s00224-025-10240-z

View Full Paper

Ask AI

Bookmark

Share

Keep reading

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1PROOFS OF LUPU’S CONJECTURES FOR MULTIPLE ZETA VALUES AND MULTIPLE <i>t</i> -VALUESOriginal Research · 2026
2Polynomial approximation in the mean on segmentsOriginal Research · 2026
3A converse of dynamical Mordell-Lang conjecture in positive characteristic2024 · 1 citations
4The longest letter-duplicated subsequence and related problems2024 · 3 citations
5Proof of a conjecture of Hong on nonsingularity of power LCM matrices on gcd-closed setsOriginal Research · 2026 · 1 citations

More related papers

CLASSIFICATION OF STANDARD YOUNG TABLEAUX IN A <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mo stretchy="false">(</mml:mo> <mml:mn>3</mml:mn> <mml:mo>,</mml:mo> <mml:mn>0</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:math> $(3,0)$left parenthesis 3 comma 0 right parenthesis- AND <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mo stretchy="false">(</mml:mo> <mml:mn>2</mml:mn> <mml:mo>,</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:math> $(2,1)$left parenthesis 2 comma 1 right parenthesis-HOOK2026
Faster Algorithms for Shortest Unique or Absent Substrings2026
There are siblings of $$\chi $$ which are permutations for n even2026

More from Theory of Computing Systems

Search Versus Search for Collapsing Electoral Control TypesMon,
A Formalization of Financial Transactions in Secure Computation: How to Handle Coins with Various ColorsSat,