|
|
|
|
Список литературы
|
|
| |
| 1. |
P. Heckel, “A technique for isolating differences between files”, Commun. ACM, 21:4 (1978), 264–268   |
| 2. |
S. V. Znamenskij, “A Belief Framework for Similarity Evaluation of Textual or Structured Data”, Similarity Search and Applications, LNCS, 9371, 2015, 138–149 |
| 3. |
G. Benson, A. Levy, R. Shalom, Longest Common Subsequence in $k$-length substrings, 2014, arXiv: 1402.2097 |
| 4. |
K.-T. Tseng, C.-B. Yang, K.-S. Huang, “The better alignment among output alignments”, Journal of Computers, 3 (2007), 51–62 |
| 5. |
Y.-P. Guo, Y.-H. Peng, C.-B. Yang, “Efficient algorithms for the flexible longest common subsequence problem”, Proceedings of the 31st Workshop on Combinatorial Mathematics and Computation Theory (2014), 1–8 |
| 6. |
C. Y. Lin, “Rouge: A package for automatic evaluation of summaries”, Proceedings of Workshop on Text Summarization Branches Out, Post-Conference Workshop of ACL 2004 (July 21–26, 2004, Barcelona, Spain), 2004, 8 pp. |
| 7. |
C.-Y. Lin, F. J. Och, “ORANGE: a Method for Evaluating Automatic Evaluation Metrics for Machine Translation”, Proceedings of 20th International Conference on Computational Linguistic, COLING 2004, 2004 |
| 8. |
A. Amir, Z. Gotthilf, B. R. Shalom, “Weighted LCS”, Journal of Discrete Algorithms, 8 (2010), 273–281  |
| 9. |
S. V. Znamenskij, “Modeling of the optimal sequence alignment problem”, Program systems: theory and applications, 5:4 (2014), 257–267  |
| 10. |
S. V. Znamenskij, “A model and algorithm for sequence alignment”, Program systems: theory and applications, 6:1 (2015), 189–197 (in Russian) |
