Pages that link to "Item:Q673783"
From MaRDI portal
The following pages link to Parallel detection of all palindromes in a string (Q673783):
Displayed 25 items.
- A subquadratic algorithm for minimum palindromic factorization (Q405573) (← links)
- Counting distinct palindromes in a word in linear time (Q407601) (← links)
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes (Q1006070) (← links)
- Parallel finding all initial palindromes and periods of a string on reconfigurable meshes (Q1266305) (← links)
- On finding a longest common palindromic subsequence (Q1698702) (← links)
- Finding approximate palindromes in strings (Q1860243) (← 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)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- Efficient computation of longest single-arm-gapped palindromes in a string (Q2297859) (← links)
- Tight tradeoffs for real-time approximation of longest palindromes in streams (Q2319637) (← links)
- Palindromic decompositions with gaps and errors (Q2399364) (← links)
- Detecting regularities on grammar-compressed strings (Q2514148) (← links)
- Finding Gapped Palindromes Online (Q2819503) (← links)
- Computing Longest Single-arm-gapped Palindromes in a String (Q2971149) (← links)
- Efficient string matching on packed texts (Q4341037) (← links)
- Comparing Degenerate Strings (Q4988951) (← links)
- Faster queries for longest substring palindrome after block edit (Q5088918) (← links)
- Longest substring palindrome after edit (Q5140775) (← links)
- Palindromic Decompositions with Gaps and Errors (Q5384622) (← links)
- Computing Longest Common Substring and All Palindromes from Compressed Strings (Q5448662) (← links)
- Finding top-\(k\) longest palindromes in substrings (Q6057835) (← links)
- Maximal degenerate palindromes with gaps and mismatches (Q6073887) (← links)
- Data structures for computing unique palindromes in static and non-static strings (Q6119834) (← links)