The following pages link to Jakub Radoszewski (Q313970):
Displaying 50 items.
- Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries (Q2957888) (← links)
- On the Maximal Sum of Exponents of Runsin a String (Q3000489) (← links)
- Efficient Seeds Computation Revisited (Q3011867) (← links)
- Polynomial-Time Approximation Algorithms for Weighted LCS Problem (Q3011875) (← links)
- Hamiltonian Paths in the Square of a Tree (Q3104603) (← links)
- String Periods in the Order-Preserving Model (Q3304137) (← links)
- Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup (Q3401119) (← links)
- Universal Reconstruction of a String (Q3449836) (← links)
- On the Maximal Number of Cubic Runs in a String (Q3564863) (← links)
- Algorithms for Three Versions of the Shortest Common Superstring Problem (Q3575256) (← links)
- On the Maximal Number of Cubic Subwords in a String (Q3651561) (← links)
- On Abelian Longest Common Factor with and without RLE (Q4611211) (← links)
- Pattern Matching and Consensus Problems on Weighted Sequences and Profiles (Q4636529) (← links)
- Efficient Counting of Square Substrings in a Tree (Q4909537) (← links)
- Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing (Q4910477) (← links)
- Fast Algorithm for Partial Covers in Words (Q4928571) (← links)
- A Linear-Time Algorithm for Seeds Computation (Q4987445) (← links)
- Longest common substring made fully dynamic (Q5075739) (← links)
- Quasi-Periodicity in Streams (Q5088913) (← links)
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor (Q5088916) (← links)
- Linear-Time Algorithm for Long LCF with k Mismatches (Q5140788) (← links)
- Longest Common Factor After One Edit Operation (Q5150915) (← links)
- Efficient Algorithms for Shortest Partial Seeds in Words (Q5165605) (← links)
- Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence (Q5165606) (← links)
- Internal Pattern Matching Queries in a Text and Applications (Q5362985) (← links)
- (Q5369536) (← links)
- Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties. (Q5369541) (← links)
- Palindromic Decompositions with Gaps and Errors (Q5384622) (← links)
- On the String Consensus Problem and the Manhattan Sequence Consensus Problem (Q5498707) (← links)
- (Q5874434) (← links)
- Unary Words Have the Smallest Levenshtein k-Neighbourhoods (Q5874436) (← links)
- Approximating Longest Common Substring with k mismatches: Theory and Practice (Q5874444) (← links)
- (Q5874446) (← links)
- (Q5874500) (← links)
- Efficient Computation of 2-Covers of a String. (Q5874549) (← links)
- (Q5875583) (← links)
- Shortest covers of all cyclic shifts of a string (Q5896123) (← links)
- Faster algorithms for 1-mappability of a sequence (Q5915892) (← links)
- Circular pattern matching with \(k\) mismatches (Q5918999) (← links)
- Efficient representation and counting of antipower factors in words (Q5919279) (← links)
- Circular pattern matching with \(k\) mismatches (Q5919356) (← links)
- Faster algorithms for 1-mappability of a sequence (Q5919433) (← links)
- Efficient enumeration of non-equivalent squares in partial words with few holes (Q5920146) (← links)
- Shortest covers of all cyclic shifts of a string (Q5925516) (← links)
- Efficient enumeration of non-equivalent squares in partial words with few holes (Q5971176) (← links)
- (Q6075918) (← links)
- (Q6075975) (← links)
- (Q6098782) (← links)
- Subsequence covers of words (Q6166966) (← links)
- (Q6187833) (← links)
