Pages that link to "Item:Q2042726"
From MaRDI portal
The following pages link to Efficient pattern matching in elastic-degenerate strings (Q2042726):
Displaying 18 items.
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852) (← links)
- Special issue: Selected papers of the 11th international conference on language and automata theory and applications, LATA 2017 (Q2042717) (← links)
- Efficient pattern matching in elastic-degenerate strings (Q2042726) (← links)
- A new approach to regular \& indeterminate strings (Q2220865) (← links)
- Approximate pattern matching on elastic-degenerate text (Q2297854) (← links)
- Comparing Degenerate Strings (Q4988951) (← links)
- (Q5090361) (← links)
- (Q5091170) (← links)
- (Q5140726) (← links)
- Faster Online Elastic Degenerate String Matching (Q5140772) (← links)
- Pattern Matching on Elastic-Degenerate Text with Errors (Q5150920) (← links)
- (Q5738992) (redirect page) (← links)
- Elastic-Degenerate String Matching via Fast Matrix Multiplication (Q5864665) (← links)
- Maximal degenerate palindromes with gaps and mismatches (Q6073887) (← 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)
- Disk compression of \(k\)-mer sets (Q6487650) (← links)
- Elastic-degenerate string matching with 1 error or mismatch (Q6635705) (← links)
