The following pages link to Veli Mäkinen (Q396711):
Displaying 20 items.
- Multi-pattern matching with bidirectional indexes (Q396713) (← links)
- Approximate all-pairs suffix/prefix overlaps (Q418172) (← links)
- Interval scheduling maximizing minimum coverage (Q528573) (← links)
- Missing pattern discovery (Q553949) (← links)
- The cycle switching graph of the Steiner triple systems of order 19 is connected (Q659722) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- Approximate matching of run-length compressed strings (Q1402213) (← links)
- Applying the positional Burrows-Wheeler transform to all-pairs Hamming distance (Q1739212) (← links)
- Fully dynamic de Bruijn graphs (Q1796842) (← links)
- (Q5090343) (← links)
- (Q5091210) (← links)
- Transposition invariant string matching (Q5692274) (← links)
- (Q5874455) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352) (← links)
- Algorithms and complexity on indexing founder graphs (Q6103519) (← links)
- (Q6147517) (← links)
- Elastic founder graphs improved and enhanced (Q6199393) (← links)
- Linear time construction of indexable founder block graphs (Q6487631) (← links)
- Indexable elastic founder graphs of minimum height (Q6496848) (← links)
