Computing Burrows-Wheeler similarity distributions for string collections
From MaRDI portal
Recommendations
- Algorithms to compute the Burrows-Wheeler similarity distribution
- Balancing and clustering of words in the Burrows-Wheeler transform
- A survey of string orderings and their application to the Burrows-Wheeler transform
- The Burrows-Wheeler similarity distribution between biological sequences based on Burrows-Wheeler transform
- Computing the Burrows-Wheeler transform of a string and its reverse in parallel
- Combinatorial Pattern Matching
- Computing the Burrows-Wheeler Transform of a String and Its Reverse
- Efficient coarse grained data distributions and string pattern matching
- Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform
Cited in
(5)- The Burrows-Wheeler similarity distribution between biological sequences based on Burrows-Wheeler transform
- Applying the positional Burrows-Wheeler transform to all-pairs Hamming distance
- A combinatorial view on string attractors
- Algorithms to compute the Burrows-Wheeler similarity distribution
- Lightweight algorithms for constructing and inverting the BWT of string collections
This page was built for publication: Computing Burrows-Wheeler similarity distributions for string collections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6109749)