The following pages link to Mai Alzamel (Q1642681):
Displaying 15 items.
- Recent advances of palindromic factorization (Q1642682) (← links)
- How to answer a small batch of RMQs or LCA queries in practice (Q1642718) (← links)
- Off-line and on-line algorithms for closed string factorization (Q2326384) (← links)
- Palindromic decompositions with gaps and errors (Q2399364) (← links)
- Efficient Computation of Palindromes in Sequences with Uncertainties* (Q4611213) (← links)
- Comparing Degenerate Strings (Q4988951) (← links)
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor (Q5088916) (← links)
- (Q5090361) (← links)
- Palindromic Decompositions with Gaps and Errors (Q5384622) (← links)
- Efficient Identification of k-Closed Strings (Q5859637) (← links)
- Finding the Anticover of a String (Q5874427) (← links)
- Faster algorithms for 1-mappability of a sequence (Q5915892) (← links)
- Faster algorithms for 1-mappability of a sequence (Q5919433) (← links)
- Maximal degenerate palindromes with gaps and mismatches (Q6073887) (← links)
- Online algorithms on antipowers and antiperiods (Q6536254) (← links)
