The following pages link to Combinatorial Pattern Matching (Q5713539):
Displaying 16 items.
- An estimator for local analysis of genome based on the minimal absent word (Q306587) (← links)
- Lightweight algorithms for constructing and inverting the BWT of string collections (Q390898) (← links)
- Binary block order Rouen transform (Q507387) (← links)
- Burrows-Wheeler transformations and de Bruijn words (Q714849) (← links)
- Wheeler graphs: a framework for BWT-based data structures (Q1676308) (← links)
- A survey of string orderings and their application to the Burrows-Wheeler transform (Q1698705) (← links)
- Computing the multi-string BWT and LCP array in external memory (Q1998862) (← links)
- On the complexity of recognizing Wheeler graphs (Q2118211) (← links)
- Distance measures for biological sequences: some recent approaches (Q2270379) (← links)
- Indeterminate string factorizations and degenerate text transformations (Q2363995) (← links)
- Algorithms to compute the Burrows-Wheeler similarity distribution (Q2420649) (← links)
- A bijective variant of the Burrows-Wheeler transform using \(V\)-order (Q2441784) (← links)
- An extension of the Burrows-Wheeler transform (Q2465062) (← links)
- A new combinatorial approach to sequence comparison (Q2481558) (← links)
- Lightweight BWT Construction for Very Large String Collections (Q3011856) (← links)
- The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words (Q5326383) (← links)