Pages that link to "Item:Q4061953"
From MaRDI portal
The following pages link to A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String (Q4061953):
Displayed 50 items.
- Palindrome pattern matching (Q390901) (← links)
- Counting the palstars (Q405318) (← links)
- A subquadratic algorithm for minimum palindromic factorization (Q405573) (← links)
- Counting distinct palindromes in a word in linear time (Q407601) (← links)
- Efficient algorithms for three variants of the LPF table (Q414447) (← links)
- Efficient computation of maximal anti-exponent in palindrome-free strings (Q507406) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- Parallel detection of all palindromes in a string (Q673783) (← links)
- Searching for gapped palindromes (Q1038475) (← links)
- Steady-paced-output and fractional-on-line algorithms on a RAM (Q1170881) (← links)
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays (Q1177175) (← links)
- Finding all the palindromes in a binary tree in linear time and space (Q1201867) (← links)
- Two fast simulations which imply some fast string matching and palindrome-recognition algorithms (Q1226857) (← links)
- Palindrome recognition in real time by a multitape Turing machine (Q1249574) (← links)
- The derivation of on-line algorithms, with an application to finding palindromes (Q1314430) (← links)
- Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes (Q1625598) (← links)
- EERTREE: an efficient data structure for processing palindromes in strings (Q1678105) (← links)
- On finding a longest common palindromic subsequence (Q1698702) (← links)
- Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets (Q1702853) (← links)
- Algorithms and combinatorial properties on shortest unique palindromic substrings (Q1711666) (← links)
- Finding maximal 2-dimensional palindromes (Q1740657) (← links)
- Detecting leftmost maximal periodicities (Q1825029) (← links)
- Finding approximate palindromes in strings (Q1860243) (← links)
- Finding all periods and initial palindromes of a string in parallel (Q1899224) (← links)
- Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings (Q2032287) (← links)
- Quantum algorithm for learning secret strings and its experimental demonstration (Q2111665) (← links)
- Minimal unique palindromic substrings after single-character substitution (Q2146122) (← links)
- Shortest unique palindromic substring queries in semi-dynamic settings (Q2169977) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- A new approach to regular \& indeterminate strings (Q2220865) (← links)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- Palindromic trees for a sliding window and its applications (Q2234804) (← links)
- Efficient computation of longest single-arm-gapped palindromes in a string (Q2297859) (← links)
- Linear-time online algorithm for inferring the shortest path graph from a walk label (Q2297861) (← links)
- Infinite all-layers simple foldability (Q2308494) (← links)
- Tight tradeoffs for real-time approximation of longest palindromes in streams (Q2319637) (← links)
- Palindromic subsequence automata and longest common palindromic subsequence (Q2363997) (← links)
- Palindromic decompositions with gaps and errors (Q2399364) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Detecting regularities on grammar-compressed strings (Q2514148) (← links)
- Finding Gapped Palindromes Online (Q2819503) (← links)
- Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
- Longest Common Extensions in Sublinear Space (Q2942246) (← links)
- Longest $$\alpha $$-Gapped Repeat and Palindrome (Q2947867) (← links)
- Computing Longest Single-arm-gapped Palindromes in a String (Q2971149) (← links)
- Palindrome Pattern Matching (Q3011857) (← links)
- Searching for Gapped Palindromes (Q3506939) (← links)
- Real-time recognition of substring repetition and reversal (Q4120141) (← links)
- Efficient string matching on packed texts (Q4341037) (← links)
- Comparing Degenerate Strings (Q4988951) (← links)
