The one-inclusion graph algorithm is near-optimal for the prediction model of learning

Yi Li, Philip M. Long, Aravind Srinivasan. The one-inclusion graph algorithm is near-optimal for the prediction model of learning. IEEE Transactions on Information Theory, 47(3):1257-1261, 2001.

@article{LiLS01,
  title = {The one-inclusion graph algorithm is near-optimal for the prediction model of learning},
  author = {Yi Li and Philip M. Long and Aravind Srinivasan},
  year = {2001},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/LiLS01},
  cites = {0},
  citedby = {0},
  journal = {IEEE Transactions on Information Theory},
  volume = {47},
  number = {3},
  pages = {1257-1261},
}