Pages that link to "Item:Q1676308"

The following pages link to Wheeler graphs: a framework for BWT-based data structures (Q1676308):

Displaying 33 items.

• Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852) (← links)
• A faster implementation of online RLBWT and its application to LZ77 parsing (Q1711660) (← links)
• XBWT tricks (Q1796830) (← links)
• Computing the multi-string BWT and LCP array in external memory (Q1998862) (← links)
• Wheeler languages (Q2051845) (← links)
• Succinct representation for (non)deterministic finite automata (Q2084735) (← links)
• 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)
• Can formal languages help pangenomics to represent and analyze multiple genomes? (Q2163974) (← links)
• The complexity of approximate pattern matching on de Bruijn graphs (Q2170154) (← links)
• When a dollar makes a BWT (Q2220786) (← links)
• Succinct representations for (non)deterministic finite automata (Q2232264) (← links)
• Lightweight merging of compressed indices based on BWT variants (Q2297864) (← links)
• The alternating BWT: an algorithmic perspective (Q2297865) (← links)
• Ordering regular languages and automata: complexity (Q2686107) (← links)
• On the Hardness and Inapproximability of Recognizing Wheeler Graphs (Q5075794) (← links)
• A new class of searchable and provably highly compressible string transformations (Q5088900) (← links)
• (Q5088915) (← links)
• Haplotype-aware graph indexes (Q5090328) (← links)
• (Q5091210) (← links)
• (Q5874481) (← links)
• A new class of string transformations for compressed text indexing (Q6053405) (← links)
• Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352) (← links)
• Efficient construction of the BWT for repetitive text using string compression (Q6077847) (← links)
• Algorithms and complexity on indexing founder graphs (Q6103519) (← links)
• Quantum time complexity and algorithms for pattern matching on labeled graphs (Q6111593) (← links)
• Computational graph pangenomics: a tutorial on data structures and their applications (Q6155034) (← links)
• Linear time construction of indexable founder block graphs (Q6487631) (← links)
• Optimal Wheeler language recognition (Q6545413) (← links)
• Space-time trade-offs for the LCP array of Wheeler DFAs (Q6545421) (← links)
• Wheeler maps (Q6547930) (← links)
• Cascade products and Wheeler automata (Q6612542) (← links)