The following pages link to (Q5091210):
Displaying 20 items.
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852) (← links)
- String graphs. II: Recognizing string graphs is NP-hard (Q1112845) (← links)
- Wheeler languages (Q2051845) (← links)
- On the complexity of approximately matching a string to a directed graph (Q2084771) (← links)
- Solving string problems on graphs using the labeled direct product (Q2088591) (← links)
- On the complexity of recognizing Wheeler graphs (Q2118211) (← links)
- Linear time construction of indexable elastic founder graphs (Q2169983) (← links)
- The complexity of approximate pattern matching on de Bruijn graphs (Q2170154) (← links)
- Fast and optimal sequence-to-graph alignment guided by seeds (Q2170166) (← links)
- Succinct representations for (non)deterministic finite automata (Q2232264) (← links)
- An external-memory algorithm for string graph construction (Q2362353) (← links)
- (Q4228434) (← links)
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533) (← 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)
- Quantum time complexity and algorithms for pattern matching on labeled graphs (Q6111593) (← links)
- Fine-Grained Complexity of Regular Path Queries (Q6137832) (← links)
- Elastic founder graphs improved and enhanced (Q6199393) (← links)
- Linear time construction of indexable founder block graphs (Q6487631) (← links)
- Optimal Wheeler language recognition (Q6545413) (← links)
