Applying the Smith-Waterman Similarity to Cellular Automata

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

The Smith–Waterman similarity (SWS) dynamic algorithm aligns two sequences of data (strings or arrays) to determine how well they match. This has been extensively applied in molecular biology to find related DNA nucleotide or protein sequences.


The SWS algorithm is used here to align the two cellular automaton (CA) paths to check for similarities between them. The recurrence plot shows an interesting visual pattern; note that the diagonal lines in red have a 100% match because the same steps align the and dimensions (columns and rows).


Contributed by: Daniel de Souza Carvalho (October 2015)
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.