1. Abe, K., Xu, Z., Sato, I., Sugiyama, M.: Solving NP-hard problems on graphs with extended alphago zero. arXiv:1905.11623 [cs, stat] (2020)
2. Bezerra, F.: A longest common subsequence approach to detect cut and wipe video transitions. In: Proceedings of the 17th Brazilian Symposium on Computer Graphics and Image Processing, pp. 154–160. IEEE Press (2004)
3. Chang, K.W., Krishnamurthy, A., Agarwal, A., Daumé, H., Langford, J.: Learning to search better than your teacher. In: Proceedings of the 32nd International Conference on Machine Learning, vol. 37, pp. 2058–2066 (2015)
4. Collins, M., Roark, B.: Incremental parsing with the perceptron algorithm. In: Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, pp. 111-es (2004)
5. Daumé, H., Marcu, D.: Learning as search optimization: approximate large margin methods for structured prediction. In: Proceedings of the 22nd International Conference on Machine Learning, pp. 169–176. ACM Press (2005)