The following pages link to Costas S. Iliopoulos (Q200907):
Displaying 13 items.
- Order-preserving indexing (Q294954) (← links)
- Efficient seed computation revisited (Q390905) (← links)
- A note on the longest common compatible prefix problem for partial words (Q491152) (← links)
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← links)
- Computing the longest previous factor (Q1761495) (← links)
- Approximate string matching for music analysis (Q1769662) (← links)
- Computing all subtree repeats in ordered trees (Q1941702) (← links)
- Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment (Q2948308) (← links)
- (Q3128912) (← links)
- (Q4330724) (← links)
- IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS (Q4923285) (← links)
- Circular Sequence Comparison with q-grams (Q5283829) (← links)
- Linear-time computation of shortest covers of all rotations of a string (Q6496851) (← links)
