The following pages link to Yoan J. Pinzon (Q200908):
Displayed 16 items.
- (Q313762) (redirect page) (← links)
- A multiobjective optimization algorithm for the weighted LCS (Q313763) (← links)
- A fast and practical bit-vector algorithm for the longest common subsequence problem (Q1607132) (← links)
- A brief history of parameterized matching problems (Q2295633) (← links)
- Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata (Q2569397) (← links)
- Practical algorithms for transposition-invariant string-matching (Q2569401) (← links)
- (Q4432970) (← links)
- (Q4432974) (← links)
- (Q4471991) (← links)
- Algorithms For Computing Approximate Repetitions In Musical Sequences (Q4780537) (← links)
- (Q4788550) (← links)
- String Processing and Information Retrieval (Q5393941) (← links)
- Experimental and Efficient Algorithms (Q5710037) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711555) (← links)
- String Processing and Information Retrieval (Q5897139) (← links)
- Computing evolutionary chains in musical sequences (Q5942559) (← links)