The following pages link to Zsuzsanna Lipták (Q450543):
Displaying 33 items.
- A linear algorithm for string reconstruction in the reverse complement equivalence model (Q450544) (← links)
- On approximate jumbled pattern matching in strings (Q692932) (← links)
- On prefix normal words and prefix normal forms (Q729994) (← links)
- Novel results on the number of runs of the Burrows-Wheeler-transform (Q831816) (← links)
- Finding submasses in weighted strings with fast Fourier transform (Q876468) (← links)
- A fast and simple algorithm for the money changing problem (Q995775) (← links)
- Algorithmic complexity of protein identification: Combinatorics of weighted strings (Q1422404) (← links)
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word (Q2006779) (← links)
- r-indexing the eBWT (Q2146118) (← links)
- Computing the original eBWT faster, simpler, and with less memory (Q2146134) (← links)
- When a dollar makes a BWT (Q2220786) (← links)
- Efficient algorithms for the periodic subgraphs mining problem (Q2376786) (← links)
- Binary jumbled string matching for highly run-length compressible texts (Q2444848) (← links)
- On the Number of Closed Factors in a Word (Q2799189) (← links)
- ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS (Q2909200) (← links)
- Efficient Reconstruction of RC-Equivalent Strings (Q3000522) (← links)
- Pattern Discovery in Colored Strings (Q5102044) (← links)
- On Combinatorial Generation of Prefix Normal Words (Q5165591) (← links)
- On Prefix Normal Words (Q5199967) (← links)
- Combinatorial Pattern Matching (Q5315327) (← links)
- Reconstruction of Trees from Jumbled and Weighted Subtrees (Q5369543) (← links)
- Computing and Combinatorics (Q5717020) (← links)
- Bubble-flip -- a new generation algorithm for prefix normal words (Q5915669) (← links)
- On infinite prefix normal words (Q5918978) (← links)
- On infinite prefix normal words (Q5919082) (← links)
- Bubble-flip -- a new generation algorithm for prefix normal words (Q5970219) (← links)
- Pattern discovery in colored strings (Q6487605) (← links)
- A theoretical and experimental analysis of BWT variants for string collections (Q6496855) (← links)
- \(r\)-indexing the eBWT (Q6543261) (← links)
- Constant time and space updates for the sigma-tau problem (Q6545441) (← links)
- A BWT-based algorithm for random de Bruijn sequence construction (Q6547923) (← links)
- Suffix sorting via matching statistics (Q6587082) (← links)
- On the number of equal-letter runs of the bijective Burrows-Wheeler transform (Q6658309) (← links)
