Pages that link to "Item:Q1827267"
From MaRDI portal
The following pages link to Efficient text fingerprinting via Parikh mapping (Q1827267):
Displaying 18 items.
- Permuted scaled matching (Q294926) (← links)
- Indexing and querying color sets of images (Q306719) (← links)
- Various improvements to text fingerprinting (Q396662) (← links)
- Towards a theory of patches (Q414472) (← links)
- A PTAS for the square tiling problem (Q476839) (← links)
- Faster query algorithms for the text fingerprinting problem (Q549671) (← links)
- Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings (Q690497) (← links)
- On approximate jumbled pattern matching in strings (Q692932) (← links)
- Finding submasses in weighted strings with fast Fourier transform (Q876468) (← links)
- New algorithms for text fingerprinting (Q935841) (← links)
- Indexing and querying character sets in one- and two-dimensional words (Q1791759) (← links)
- Generalized mapping for multiset rewriting systems (Q2100284) (← links)
- Improved approximate common interval (Q2379959) (← links)
- Approximating the maximum consecutive subsums of a sequence (Q2437755) (← links)
- Efficient one-dimensional real scaled matching (Q2457290) (← links)
- Character sets of strings (Q2457304) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS (Q2909200) (← links)
