Shortest Common Superstring (German Wikipedia)

Analysis of information sources in references of the Wikipedia article "Shortest Common Superstring" in German language version.

refsWebsite

Global rank German rank

2^nd place

3^rd place

1geeksforgeeks.org

low place

2,494^th place

doi.org

Kari-Jouko Räihä, Esko Ukkonen: The shortest common supersequence problem over binary alphabet is NP-complete. In: Theoretical Computer Science. 16. Jahrgang, Nr. 2, 1981, S. 187–198, doi:10.1016/0304-3975(81)90075-x (englisch).

geeksforgeeks.org

https://www.geeksforgeeks.org/shortest-superstring-problem/