CHAIN_LETTERS
A Small Collection of Chain Letters

CHAIN_LETTERS is a dataset directory which holds a small collection of chain letters, which currently are all variations of a common form, called the "Good Luck" or "Saint Jude" chain letter.

Licensing:

The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.

Datasets:

• luck_a.txt, example A;
• luck_b.txt, example B;
• luck_c.txt, example C;
• luck_d.txt, example D;
• luck_e.txt, example E; quoted in a letter to Nature, Volume 371, 1 September 1994, by Oliver Goodenough and Richard Dawkins.
• luck_f.txt, example F;
• luck_g.txt, example G;
• luck_h.txt, example H;
• luck_i.txt, example I; appeared in the story "Philomena", by Jay McInerny, The New Yorker, December 25, 1995 & 6 January 1, 1996.
• luck_j.txt, example J;
• luck_k.txt, example K;

Other items:

• dawkins.txt, a letter by Richard Dawkins and Oliver Goodenough, discussing a chain letter;
• chain_letter_tree.m, a MATLAB program to collate and plot the results of a classroom exercise, in which a distance table was made for chain letters A through K;
• chain_letter_tree_output.txt, the printed output from the program, a copy of the estimated distances.
• chain_letter_tree.png, a PNG file which displays MATLAB's dendrogram of the chain letter distances, using single linkage clustering;

You can go up one level to the DATASETS directory.