The following pages link to Indexing Variation Graphs (Q5232561):
Displaying 17 items.
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852) (← links)
- Wheeler graphs: a framework for BWT-based data structures (Q1676308) (← links)
- FM-index of alignment with gaps (Q1698723) (← links)
- Wheeler languages (Q2051845) (← links)
- Space efficient merging of de Bruijn graphs and Wheeler graphs (Q2118200) (← links)
- Approximate pattern matching on elastic-degenerate text (Q2297854) (← links)
- Lightweight merging of compressed indices based on BWT variants (Q2297864) (← links)
- AStarix: Fast and Optimal Sequence-to-Graph Alignment (Q5041800) (← links)
- Haplotype-aware graph indexes (Q5090328) (← links)
- Read Mapping on Genome Variation Graphs (Q5091734) (← links)
- (Q5140726) (← links)
- Pattern Matching on Elastic-Degenerate Text with Errors (Q5150920) (← links)
- Bidirectional Variable-Order de Bruijn Graphs (Q5384620) (← links)
- Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended (Q5881345) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352) (← links)
- Computational graph pangenomics: a tutorial on data structures and their applications (Q6155034) (← links)
- From de Bruijn graphs to variation graphs -- relationships between pangenome models (Q6545419) (← links)
