Pages that link to "Item:Q5362985"

The following pages link to Internal Pattern Matching Queries in a Text and Applications (Q5362985):

Displaying 28 items.

• Computing minimal and maximal suffixes of a substring (Q294952) (← links)
• Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
• Internal dictionary matching (Q2037109) (← links)
• Multidimensional period recovery (Q2144266) (← links)
• Dynamic and internal longest common substring (Q2211363) (← links)
• Two-dimensional maximal repetitions (Q2297850) (← links)
• Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
• String Powers in Trees (Q2942264) (← links)
• On Maximal Unbordered Factors (Q2942272) (← links)
• Universal Reconstruction of a String (Q3449836) (← links)
• (Q5009559) (← links)
• Repetition Detection in a Dynamic String (Q5075738) (← links)
• Longest common substring made fully dynamic (Q5075739) (← links)
• Quasi-Linear-Time Algorithm for Longest Common Circular Factor (Q5088916) (← links)
• (Q5091065) (← links)
• (Q5091170) (← links)
• Detecting One-Variable Patterns (Q5150937) (← links)
• The “Runs” Theorem (Q5359492) (← links)
• Elastic-Degenerate String Matching via Fast Matrix Multiplication (Q5864665) (← links)
• (Q5874500) (← links)
• Practical Performance of Space Efficient Data Structures for Longest Common Extensions. (Q5874509) (← links)
• Efficient Computation of 2-Covers of a String. (Q5874549) (← links)
• Maximal unbordered factors of random strings (Q5916287) (← links)
• Circular pattern matching with \(k\) mismatches (Q5918999) (← links)
• Shortest covers of all cyclic shifts of a string (Q5925516) (← links)
• Finding top-\(k\) longest palindromes in substrings (Q6057835) (← links)
• Near-optimal quantum algorithms for string problems (Q6174814) (← links)
• Internal pattern matching queries in a text and applications (Q6621750) (← links)