Shortest common supersequence (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Shortest common supersequence" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

2semanticscholar.org

11^th place

8^th place

1,185^th place

840^th place

4,378^th place

2,689^th place

4,448^th place

2,923^rd place

acm.org (Global: 1,185^th place; English: 840^th place)

dl.acm.org

Matthias Englert and Nicolaos Matsakis and Pavel Vesel (2022). "Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios". Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (PDF). pp. 317–330. doi:10.1145/3519935.3520001. ISBN 9781450392648. S2CID 243847650.

doi.org (Global: 2^nd place; English: 2^nd place)

David Maier (1978). "The Complexity of Some Problems on Subsequences and Supersequences". J. ACM. 25 (2). ACM Press: 322–336. doi:10.1145/322063.322075. S2CID 16120634.
Kari-Jouko Räihä, Esko Ukkonen (1981). "The shortest common supersequence problem over binary alphabet is NP-complete". Theoretical Computer Science. 16 (2): 187–198. doi:10.1016/0304-3975(81)90075-x.
Matthias Englert and Nicolaos Matsakis and Pavel Vesel (2022). "Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios". Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (PDF). pp. 317–330. doi:10.1145/3519935.3520001. ISBN 9781450392648. S2CID 243847650.

gatech.edu (Global: 4,448^th place; English: 2,923^rd place)

cc.gatech.edu

Vazirani 2001, p. 20. Vazirani, Vijay V. (2001), Approximation Algorithms, Springer-Verlag, ISBN 3-540-65367-8

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

David Maier (1978). "The Complexity of Some Problems on Subsequences and Supersequences". J. ACM. 25 (2). ACM Press: 322–336. doi:10.1145/322063.322075. S2CID 16120634.
Matthias Englert and Nicolaos Matsakis and Pavel Vesel (2022). "Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios". Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (PDF). pp. 317–330. doi:10.1145/3519935.3520001. ISBN 9781450392648. S2CID 243847650.

warwick.ac.uk (Global: 4,378^th place; English: 2,689^th place)

wrap.warwick.ac.uk

Matthias Englert and Nicolaos Matsakis and Pavel Vesel (2022). "Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios". Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (PDF). pp. 317–330. doi:10.1145/3519935.3520001. ISBN 9781450392648. S2CID 243847650.