Burrows–Wheeler transform

Target entity: Burrows–Wheeler transform
Context triple: [bzip2, usesAlgorithm, Burrows–Wheeler transform]

• A. Boyer–Moore string-search algorithm
  The Boyer–Moore string-search algorithm is a highly efficient pattern-matching algorithm that scans text from right to left and uses precomputed shift rules to skip sections of the text, making it one of the fastest practical algorithms for substring search.
• B. Aho–Corasick algorithm
  The Aho–Corasick algorithm is a classic string-searching algorithm that efficiently finds all occurrences of multiple patterns in a text using a trie-based finite-state machine.
• C. Lloyd’s algorithm
  Lloyd’s algorithm is an iterative clustering method that partitions data into k groups by repeatedly assigning points to the nearest cluster center and updating those centers to minimize within-cluster variance.
• D. Rabin–Karp algorithm
  The Rabin–Karp algorithm is a string-searching technique that uses hashing to efficiently find any one of a set of pattern strings in a text.
• E. Huffman
  Huffman is a surname most commonly associated with the American computer scientist David A. Huffman, known for developing Huffman coding in information theory and data compression.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Burrows–Wheeler transform
Target entity description: The Burrows–Wheeler transform is a reversible text transformation used in data compression to rearrange a string into runs of similar characters, enabling more efficient encoding by subsequent algorithms.

• A. Boyer–Moore string-search algorithm
  The Boyer–Moore string-search algorithm is a highly efficient pattern-matching algorithm that scans text from right to left and uses precomputed shift rules to skip sections of the text, making it one of the fastest practical algorithms for substring search.
• B. Aho–Corasick algorithm
  The Aho–Corasick algorithm is a classic string-searching algorithm that efficiently finds all occurrences of multiple patterns in a text using a trie-based finite-state machine.
• C. Lloyd’s algorithm
  Lloyd’s algorithm is an iterative clustering method that partitions data into k groups by repeatedly assigning points to the nearest cluster center and updating those centers to minimize within-cluster variance.
• D. Rabin–Karp algorithm
  The Rabin–Karp algorithm is a string-searching technique that uses hashing to efficiently find any one of a set of pattern strings in a text.
• E. Huffman
  Huffman is a surname most commonly associated with the American computer scientist David A. Huffman, known for developing Huffman coding in information theory and data compression.
• F. None of above. chosen