Pages that link to "Item:Q673783"
From MaRDI portal
The following pages link to Parallel detection of all palindromes in a string (Q673783):
Displayed 12 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)
- 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)
- Computing Longest Common Substring and All Palindromes from Compressed Strings (Q5448662) (← links)