The following pages link to Jakub Radoszewski (Q313970):
Displaying 50 items.
- (Q266802) (redirect page) (← links)
- Polynomial-time approximation algorithms for weighted LCS problem (Q266804) (← links)
- Order-preserving indexing (Q294954) (← links)
- Maximum number of distinct and nonequivalent nonstandard squares in a word (Q313973) (← links)
- Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577) (← links)
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- Efficient seed computation revisited (Q390905) (← links)
- A linear time algorithm for consecutive permutation pattern matching (Q396621) (← links)
- On the structure of compacted subword graphs of Thue-Morse words and their applications (Q414440) (← links)
- On the maximal sum of exponents of runs in a string (Q450542) (← links)
- A note on the longest common compatible prefix problem for partial words (Q491152) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← links)
- Linear-time version of Holub's algorithm for morphic imprimitivity testing (Q497670) (← links)
- Efficient indexes for jumbled pattern matching with constant-sized alphabet (Q524375) (← links)
- On the greedy algorithm for the shortest common superstring problem with reversals (Q903196) (← links)
- On periodicity lemma for partial words (Q1647705) (← links)
- Covering problems for partial words and for indeterminate strings (Q1676304) (← links)
- String powers in trees (Q1679231) (← links)
- On the string consensus problem and the Manhattan sequence consensus problem (Q1698720) (← links)
- Efficient algorithms for shortest partial seeds in words (Q1698721) (← links)
- On-line weighted pattern matching (Q1740646) (← links)
- The maximal number of cubic runs in a word (Q1757839) (← links)
- On the maximum number of cubic subwords in a word (Q1761496) (← links)
- Near-optimal computation of runs over general alphabet via non-crossing LCE queries (Q1796824) (← links)
- A note on efficient computation of all abelian periods in a string (Q1943614) (← links)
- Pattern matching and consensus problems on weighted sequences and profiles (Q2000001) (← links)
- Internal dictionary matching (Q2037109) (← links)
- A periodicity lemma for partial words (Q2113379) (← links)
- \(k\)-approximate quasiperiodicity under Hamming and edit distance (Q2118198) (← links)
- Efficient computation of sequence mappability (Q2134748) (← links)
- String covers of a tree (Q2146126) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Optimal skeleton and reduced Huffman trees (Q2220839) (← links)
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- Efficient counting of square substrings in a tree (Q2250458) (← links)
- Indexing weighted sequences: neat and efficient (Q2288210) (← links)
- String periods in the order-preserving model (Q2288212) (← links)
- Universal reconstruction of a string (Q2297860) (← links)
- Streaming \(k\)-mismatch with error correcting and applications (Q2304535) (← links)
- Palindromic decompositions with gaps and errors (Q2399364) (← links)
- Two strings at Hamming distance 1 cannot be both quasiperiodic (Q2404618) (← links)
- Longest common substring with approximately \(k\) mismatches (Q2414870) (← links)
- Correction to: ``Longest common substring with approximately \(k\) mismatches'' (Q2415358) (← links)
- Subquadratic-Time Algorithms for Abelian Stringology Problems (Q2807851) (← links)
- Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence (Q2830442) (← links)
- Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet (Q2849352) (← links)
- The Maximum Number of Squares in a Tree (Q2904476) (← links)
- Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word (Q2921985) (← links)
- String Powers in Trees (Q2942264) (← links)
