Pages that link to "Item:Q5075794"

The following pages link to On the Hardness and Inapproximability of Recognizing Wheeler Graphs (Q5075794):

Displaying 9 items.

• Solving string problems on graphs using the labeled direct product (Q2088591) (← links)
• Space efficient merging of de Bruijn graphs and Wheeler graphs (Q2118200) (← links)
• On the complexity of recognizing Wheeler graphs (Q2118211) (← links)
• The complexity of approximate pattern matching on de Bruijn graphs (Q2170154) (← links)
• Ordering regular languages and automata: complexity (Q2686107) (← links)
• (Q5874481) (← 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)