Bibliography

1

E. Lehman, and A. Shelat, "Approximations algorithms for grammar-based compression", In Thirteenth Annual Symposium on Discrete Algorithms (SODA), 2002.

2

D. Cook, and L. Holder, "Substructure Discovery Using Minimum Description Length and Background Knowledge", Journal of Artificial Intelligence Research, 1994, 1, pp. 231-255.

3

G. Rozenberg (Ed.) "Handbook of graph grammars and computing by graph transformation: Foundations", World Scientific Publishing Company, 1997.

4

H. Gabow, "Implementation of Algorithms for Maximum Matching on Nonbipartite Graphs", Ph.D. thesis, Stanford University, 1973.

5

J. Ellson, E. Gansner, E. Koutsofios, S. North, and G. Woodhull, "Graphviz and Dynagraph - Static and Dynamic Graph Drawing Tools", Graph Drawing Software, Springer Verlag, 2003.

6

C. Nevill-Manning, and I. Witten, "Identifying Hierarchical Structure in Sequences: A linear-time algorithm", Journal of Artificial Intelligence Research, 1997, 7, pp. 67-82.

7

A. Apostolico, and S. Lonardi, "Off-line Compression by Greedy Textual Substitution", Proceedings of the IEEE DCC Data Compression Conference, 2000, 88, pp. 1733-44.

8

Z. Solan, D. Horn, I. Ruppin, and S. Edelman, "Unsupervised learning of natural languages", Proceedings of the National Academy of Sciences, 2005, 102, pp. 11629-34.

9

O. Shen-Orr, R. Milo, S. Mangan, and U. Alon, "Network motifs in the transcriptional regulation network of Escherichia coli", Nature Genetics, 2002, 31, pp. 64-68.

10

A. Stolcke, and S. Omoho, "Hidden Markov model induction by Bayesian model merging", Advances in Neural Information Processing Systems, 1993, 5, pp. 11-18.