The following pages link to (Q5090361):
Displaying 9 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)
- Longest property-preserved common factor: a new string-processing framework (Q2297866) (← links)
- Indeterminate string factorizations and degenerate text transformations (Q2363995) (← links)
- Comparing Degenerate Strings (Q4988951) (← links)
- (Q5091170) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352) (← links)
- Linear time construction of indexable founder block graphs (Q6487631) (← links)
- Elastic-degenerate string matching with 1 error or mismatch (Q6635705) (← links)