The following pages link to Veli Mäkinen (Q396711):
Displaying 50 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)
- Linear time construction of indexable elastic founder graphs (Q2169983) (← links)
- Efficient construction of maximal and minimal representations of motifs of a string (Q2271439) (← links)
- Rotation and lighting invariant template matching (Q2373879) (← links)
- Rank and select revisited and extended (Q2465064) (← links)
- On minimizing pattern splitting in multi-track string matching (Q2569400) (← links)
- (Q2723961) (← links)
- Bidirectional Variable-Order de Bruijn Graphs (Q2802936) (← links)
- Gap Filling as Exact Path Length Problem (Q2814587) (← links)
- Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform (Q2849305) (← links)
- Forbidden Patterns (Q2894477) (← links)
- Indexed Multi-pattern Matching (Q2894483) (← links)
- Multi-pattern Matching with Bidirectional Indexes (Q2914343) (← links)
- Compressed representations of sequences and full-text indexes (Q2944557) (← links)
- FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIME (Q3421849) (← links)
- A SIMPLE ALPHABET-INDEPENDENT FM-INDEX (Q3421851) (← links)
- Space-Efficient Algorithms for Document Retrieval (Q3506923) (← links)
- An(other) Entropy-Bounded Compressed Suffix Tree (Q3506950) (← links)
- Position-Restricted Substring Searching (Q3525802) (← links)
- On Minimizing Pattern Splitting in Multi-track String Matching (Q3550839) (← links)
- Unified View of Backward Backtracking in Short Read Mapping (Q3558271) (← links)
- Approximate All-Pairs Suffix/Prefix Overlaps (Q3575238) (← links)
- Storage and Retrieval of Individual Genomes (Q3630150) (← links)
- (Q4413809) (← links)
- (Q4418649) (← links)
- (Q4432981) (← links)
- (Q4547735) (← links)
- (Q4737694) (← links)
- (Q4801191) (← links)
- Dynamic entropy-compressed sequences and full-text indexes (Q4962737) (← links)
- Sparse Dynamic Programming on DAGs with Small Width (Q4972674) (← links)
- Linear-time String Indexing and Analysis in Small Space (Q4987434) (← links)
- (Q5090343) (← links)
- (Q5091210) (← links)
- Dynamic Entropy-Compressed Sequences and Full-Text Indexes (Q5307515) (← links)
- Combinatorial Pattern Matching (Q5315350) (← links)
- Bidirectional Variable-Order de Bruijn Graphs (Q5384620) (← links)
- String Processing and Information Retrieval (Q5393950) (← links)
- String Processing and Information Retrieval (Q5393958) (← links)
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections (Q5505395) (← links)
- Transposition invariant string matching (Q5692274) (← links)
