The following pages link to (Q5091170):
Displaying 8 items.
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852) (← links)
- Approximate pattern matching on elastic-degenerate text (Q2297854) (← links)
- Comparing Degenerate Strings (Q4988951) (← 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)
- Linear time construction of indexable founder block graphs (Q6487631) (← links)
