Sequitur algorithm
= Sequitur algorithm
{wiki=Sequitur_algorithm}
The Sequitur algorithm is a data compression algorithm that identifies and exploits patterns in sequences, making it particularly effective for tasks like data compression and pattern discovery. Developed by the researcher Nevill-Manning and Witten in the mid-1990s, the algorithm seeks to find repeated substrings in a given sequence and encode them in a way that reduces the overall size of the data.