Are Algebraic types just the combination of case classes and pattern matching?

Question

On this page describing the precursor to the Scala language - the pizza language - they refer to it having both case classes and pattern matching - and then imply that these taken together provide algebraic types.

Is this the case? To provide algebraic types - do you combine case classes and pattern matching?