The following pages link to Tomasz Walen (Q1010604):
Displayed 50 items.
- Item:Q1010604 (redirect page) (← links)
- Polynomial-time approximation algorithms for weighted LCS problem (Q266804) (← links)
- Order-preserving indexing (Q294954) (← links)
- Item:Q1010604 (redirect page) (← links)
- Maximum number of distinct and nonequivalent nonstandard squares in a word (Q313973) (← 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)
- Efficient algorithms for three variants of the LPF table (Q414447) (← links)
- Improved algorithms for the range next value problem and applications (Q428870) (← 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)
- Improved induced matchings in sparse graphs (Q608287) (← links)
- Approximation of RNA multiple structural alignment (Q655441) (← links)
- Approximating reversal distance for strings with bounded number of duplicates (Q868388) (← links)
- On the greedy algorithm for the shortest common superstring problem with reversals (Q903196) (← links)
- Reversal distance for strings with duplicates: linear time approximation using hitting set (Q1010605) (← 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)
- The maximal number of cubic runs in a word (Q1757839) (← links)
- Computing the longest previous factor (Q1761495) (← 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)
- Internal dictionary matching (Q2037109) (← links)
- A periodicity lemma for partial words (Q2113379) (← links)
- String covers of a tree (Q2146126) (← links)
- Efficient counting of square substrings in a tree (Q2250458) (← links)
- String periods in the order-preserving model (Q2288212) (← links)
- Universal reconstruction of a string (Q2297860) (← links)
- RNA multiple structural alignment with longest common subsequences (Q2385486) (← 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)
- On the Maximal Sum of Exponents of Runsin a String (Q3000489) (← links)
- Finding Patterns In Given Intervals (Q3008096) (← links)
- Efficient Seeds Computation Revisited (Q3011867) (← links)
- Polynomial-Time Approximation Algorithms for Weighted LCS Problem (Q3011875) (← links)
- (Q3304137) (← links)
- Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays (Q3401100) (← links)
- Universal Reconstruction of a String (Q3449836) (← links)
- Algorithms for Computing the Longest Parameterized Common Subsequence (Q3506928) (← 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)