Sequence driven algorithms

• Group similar sequences together (e.g., in pairs);

• For each group find a common pattern (e.g., by dynamic programming);

• Group similar patterns together and repeat the previous step until there is only one group left

Previous slide

Next slide

Back to first slide

View graphic version