Pages that link to "Item:Q1177175"

The following pages link to Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays (Q1177175):

Displayed 13 items.

• Parallel detection of all palindromes in a string (Q673783) ‎ (← links)
• Efficient detection of quasiperiodicities in strings (Q688155) ‎ (← links)
• Masking patterns in sequences: A new class of motif discovery with don't cares (Q732023) ‎ (← links)
• An efficient algorithm for online square detection (Q860815) ‎ (← links)
• Optimal parallel detection of squares in strings (Q1194333) ‎ (← links)
• Finding all the palindromes in a binary tree in linear time and space (Q1201867) ‎ (← links)
• Alphabet-independent optimal parallel search for three-dimensional patterns (Q1275083) ‎ (← links)
• Parallel construction and query of index data structures for pattern matching on square matrices (Q1288531) ‎ (← links)
• On two-dimensional pattern matching by optimal parallel algorithms (Q1334677) ‎ (← links)
• Finding all periods and initial palindromes of a string in parallel (Q1899224) ‎ (← links)
• Fast parallel Lyndon factorization with applications (Q4327381) ‎ (← links)
• Efficient string matching on packed texts (Q4341037) ‎ (← links)
• Detecting the morphic images of a word : improving the general algorithm (Q4348237) ‎ (← links)