The following pages link to Jan Holub (Q954953):
Displayed 23 items.
- Fast pattern-matching on indeterminate strings (Q954954) (← links)
- Improving practical exact string matching (Q990135) (← links)
- Item:Q954953 (redirect page) (← links)
- Approximate string matching using factor automata (Q1583536) (← links)
- Towards efficient positional inverted index (Q1662625) (← links)
- Reconstructing a string from its Lyndon arrays (Q1698704) (← links)
- ODC: frame for definition of dense codes (Q1761498) (← links)
- (Q2731277) (← links)
- Suffix Tree of Alignment: An Efficient Index for Similar Data (Q2870039) (← links)
- (Q3084791) (← links)
- (Q3143775) (← links)
- (Q3165665) (← links)
- On Parallel Implementations of Deterministic Finite Automata (Q3637342) (← links)
- New Word-Based Adaptive Dense Compressors (Q3651568) (← links)
- (Q4412576) (← links)
- (Q4418628) (← links)
- (Q4418629) (← links)
- (Q4660320) (← links)
- (Q4820870) (← links)
- (Q5111826) (← links)
- PFP Compressed Suffix Trees (Q5147525) (← links)
- Tuning BNDM with<i>q</i>-Grams (Q5233563) (← links)
- Finding Common Motifs with Gaps Using Finite Automata (Q5757222) (← links)