Algoritmo Hunt-Szymanski (Portuguese Wikipedia)

Analysis of information sources in references of the Wikipedia article "Algoritmo Hunt-Szymanski" in Portuguese language version.

refsWebsite

Global rank Portuguese rank

5^th place

9,605^th place

8,221^st place

3,063^rd place

3,636^th place

2,242^nd place

2,362^nd place

2,069^th place

47^th place

dartmouth.edu

Hunt, James W.; McIlroy, M. Douglas (junho de 1976). «An Algorithm for Differential File Comparison» (PDF). Bell Laboratories. Computing Science Technical Report. 41

«The Hunt-Szymanski Algorithm for LCS» (PDF). Department of Mathematics and Computer Science, University of Southern Denmark. 12 de janeiro de 2017

Aho, A.; Hirschberg, D.; Ullman, J. (1976). «Bounds on the Complexity of the Longest Common Subsequence Problem» (PDF). Journal of the ACM. 23 (1): 1-12. ISSN 0004-5411

Imre Simon (2 de abril de 1988). «Sequence Comparison: Some Theory and Some Practice». Universidade de São Paulo

Grabowski, Szymon (2016). «New tabulation and sparse dynamic programming based techniques for sequence similarity problems». Discrete Applied Mathematics. 212 (C): 96-103. ISSN 0166-218X
Aho, A.; Hirschberg, D.; Ullman, J. (1976). «Bounds on the Complexity of the Longest Common Subsequence Problem» (PDF). Journal of the ACM. 23 (1): 1-12. ISSN 0004-5411