Suffix tree (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Suffix tree" in English language version.

Last modified: 23:43:20, 13 August 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

109doi.org

2^nd place

87semanticscholar.org

15^th place

8^th place

53web.archive.org

1^st place

43psu.edu

299^th place

159^th place

32vldb.org

low place

31uvic.ca

6,589^th place

3,880^th place

21uni-hamburg.de

3,375^th place

4,648^th place

21allisons.org

low place

21viu.ca

low place

11jhu.edu

560^th place

313^th place

11unice.fr

low place

11utah.edu

2,766^th place

1,555^th place

11purdue.edu

1,391^st place

979^th place

11sciencedirect.com

137^th place

146^th place

11rutgers.edu

2,011^th place

1,139^th place

11arxiv.org

49^th place

31^st place

11adsabs.harvard.edu

14^th place

9^th place

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

Mansour et al. (2011). Mansour, Essam; Allam, Amin; Skiadopoulos, Spiros; Kalnis, Panos (2011), "ERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings" (PDF), Proceedings of the VLDB Endowment, 5 (1): 49–60, arXiv:1109.6884, Bibcode:2011arXiv1109.6884M, doi:10.14778/2047485.2047490, S2CID 7582116.

allisons.org (Global: low place; English: low place)

Allison, L. "Suffix Trees". Archived from the original on 2008-10-13. Retrieved 2008-10-14.

arxiv.org (Global: 49^th place; English: 31^st place)

Mansour et al. (2011). Mansour, Essam; Allam, Amin; Skiadopoulos, Spiros; Kalnis, Panos (2011), "ERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings" (PDF), Proceedings of the VLDB Endowment, 5 (1): 49–60, arXiv:1109.6884, Bibcode:2011arXiv1109.6884M, doi:10.14778/2047485.2047490, S2CID 7582116.

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

Donald E. Knuth; James H. Morris; Vaughan R. Pratt (Jun 1977). "Fast Pattern Matching in Strings" (PDF). SIAM Journal on Computing. 6 (2): 323–350. doi:10.1137/0206024. Here: p.339 bottom.
Knuth conjectured in 1970 that the problem could not be solved in linear time.^[1] In 1973, this was refuted by Weiner's suffix-tree algorithm Weiner (1973). Weiner, P. (1973), "Linear pattern matching algorithms" (PDF), 14th Annual IEEE Symposium on Switching and Automata Theory, pp. 1–11, doi:10.1109/SWAT.1973.13, archived from the original (PDF) on 2016-03-03, retrieved 2015-04-16.
This term is used here to distinguish Weiner's precursor data structures from proper suffix trees as defined above and unconsidered before McCreight (1976). McCreight, Edward M. (1976), "A Space-Economical Suffix Tree Construction Algorithm", Journal of the ACM, 23 (2): 262–272, doi:10.1145/321941.321946, S2CID 9250303.
Giegerich & Kurtz (1997). Giegerich, R.; Kurtz, S. (1997), "From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction" (PDF), Algorithmica, 19 (3): 331–353, doi:10.1007/PL00009177, S2CID 18039097, archived from the original (PDF) on 2016-03-03, retrieved 2012-07-13.
Baeza-Yates & Gonnet (1996). Baeza-Yates, Ricardo A.; Gonnet, Gaston H. (1996), "Fast text searching for regular expressions or automaton searching on tries", Journal of the ACM, 43 (6): 915–936, doi:10.1145/235809.235810, S2CID 1420298.
Apostolico et al. (1988). Apostolico, A.; Iliopoulos, C.; Landau, G. M.; Schieber, B.; Vishkin, U. (1988), "Parallel construction of a suffix tree with applications", Algorithmica, 3 (1–4): 347–365, doi:10.1007/bf01762122, S2CID 5024136.
Sahinalp & Vishkin (1994). Sahinalp, Cenk; Vishkin, Uzi (1994), "Symmetry breaking for suffix tree construction", ACM Symposium on Theory of Computing, pp. 300–309, doi:10.1145/195058.195164, ISBN 0-89791-663-8, S2CID 5985171
Shun & Blelloch (2014). Shun, Julian; Blelloch, Guy E. (2014), "A Simple Parallel Cartesian Tree Algorithm and its Application to Parallel Suffix Tree Construction", ACM Transactions on Parallel Computing, 1: 1–20, doi:10.1145/2661653, S2CID 1912378.
Mansour et al. (2011). Mansour, Essam; Allam, Amin; Skiadopoulos, Spiros; Kalnis, Panos (2011), "ERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings" (PDF), Proceedings of the VLDB Endowment, 5 (1): 49–60, arXiv:1109.6884, Bibcode:2011arXiv1109.6884M, doi:10.14778/2047485.2047490, S2CID 7582116.

jhu.edu (Global: 560^th place; English: 313^th place)

cs.jhu.edu

Donald E. Knuth; James H. Morris; Vaughan R. Pratt (Jun 1977). "Fast Pattern Matching in Strings" (PDF). SIAM Journal on Computing. 6 (2): 323–350. doi:10.1137/0206024. Here: p.339 bottom.

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

First introduced by Zamir & Etzioni (1998). Zamir, Oren; Etzioni, Oren (1998), "Web document clustering: a feasibility demonstration", SIGIR '98: Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval, New York, NY, USA: ACM, pp. 46–54, CiteSeerX 10.1.1.36.4719 {{citation}}: Cite uses deprecated parameter |citeseerx= (help).
Iliopoulos & Rytter (2004). Iliopoulos, Costas; Rytter, Wojciech (2004), "On Parallel Transformations of Suffix Arrays into Suffix Trees", 15th Australasian Workshop on Combinatorial Algorithms, CiteSeerX 10.1.1.62.6715 {{citation}}: Cite uses deprecated parameter |citeseerx= (help).
Phoophakdee & Zaki (2007). Phoophakdee, Benjarath; Zaki, Mohammed J. (2007), "Genome-scale disk-based suffix tree indexing", SIGMOD '07: Proceedings of the ACM SIGMOD International Conference on Management of Data, New York, NY, USA: ACM, pp. 833–844, CiteSeerX 10.1.1.81.6031 {{citation}}: Cite uses deprecated parameter |citeseerx= (help).

purdue.edu (Global: 1,391^st place; English: 979^th place)

docs.lib.purdue.edu

Apostolico et al. (1988). Apostolico, A.; Iliopoulos, C.; Landau, G. M.; Schieber, B.; Vishkin, U. (1988), "Parallel construction of a suffix tree with applications", Algorithmica, 3 (1–4): 347–365, doi:10.1007/bf01762122, S2CID 5024136.

rutgers.edu (Global: 2,011^th place; English: 1,139^th place)

people.cs.rutgers.edu

Farach & Muthukrishnan (1996). Farach, Martin; Muthukrishnan, S. (1996), "Optimal Logarithmic Time Randomized Suffix Tree Construction", International Colloquium on Automata Languages and Programming (PDF).

sciencedirect.com (Global: 137^th place; English: 146^th place)

Hariharan (1994). Hariharan, Ramesh (1994), "Optimal Parallel Suffix Tree Construction", ACM Symposium on Theory of Computing (PDF).

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

api.semanticscholar.org

This term is used here to distinguish Weiner's precursor data structures from proper suffix trees as defined above and unconsidered before McCreight (1976). McCreight, Edward M. (1976), "A Space-Economical Suffix Tree Construction Algorithm", Journal of the ACM, 23 (2): 262–272, doi:10.1145/321941.321946, S2CID 9250303.
Giegerich & Kurtz (1997). Giegerich, R.; Kurtz, S. (1997), "From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction" (PDF), Algorithmica, 19 (3): 331–353, doi:10.1007/PL00009177, S2CID 18039097, archived from the original (PDF) on 2016-03-03, retrieved 2012-07-13.
Baeza-Yates & Gonnet (1996). Baeza-Yates, Ricardo A.; Gonnet, Gaston H. (1996), "Fast text searching for regular expressions or automaton searching on tries", Journal of the ACM, 43 (6): 915–936, doi:10.1145/235809.235810, S2CID 1420298.
Apostolico et al. (1988). Apostolico, A.; Iliopoulos, C.; Landau, G. M.; Schieber, B.; Vishkin, U. (1988), "Parallel construction of a suffix tree with applications", Algorithmica, 3 (1–4): 347–365, doi:10.1007/bf01762122, S2CID 5024136.
Sahinalp & Vishkin (1994). Sahinalp, Cenk; Vishkin, Uzi (1994), "Symmetry breaking for suffix tree construction", ACM Symposium on Theory of Computing, pp. 300–309, doi:10.1145/195058.195164, ISBN 0-89791-663-8, S2CID 5985171
Shun & Blelloch (2014). Shun, Julian; Blelloch, Guy E. (2014), "A Simple Parallel Cartesian Tree Algorithm and its Application to Parallel Suffix Tree Construction", ACM Transactions on Parallel Computing, 1: 1–20, doi:10.1145/2661653, S2CID 1912378.
Mansour et al. (2011). Mansour, Essam; Allam, Amin; Skiadopoulos, Spiros; Kalnis, Panos (2011), "ERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings" (PDF), Proceedings of the VLDB Endowment, 5 (1): 49–60, arXiv:1109.6884, Bibcode:2011arXiv1109.6884M, doi:10.14778/2047485.2047490, S2CID 7582116.

uni-hamburg.de (Global: 3,375^th place; English: 4,648^th place)

europa.zbh.uni-hamburg.de

Giegerich & Kurtz (1997). Giegerich, R.; Kurtz, S. (1997), "From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction" (PDF), Algorithmica, 19 (3): 331–353, doi:10.1007/PL00009177, S2CID 18039097, archived from the original (PDF) on 2016-03-03, retrieved 2012-07-13.

unice.fr (Global: low place; English: low place)

airelles.i3s.unice.fr

Knuth conjectured in 1970 that the problem could not be solved in linear time.^[1] In 1973, this was refuted by Weiner's suffix-tree algorithm Weiner (1973). Weiner, P. (1973), "Linear pattern matching algorithms" (PDF), 14th Annual IEEE Symposium on Switching and Automata Theory, pp. 1–11, doi:10.1109/SWAT.1973.13, archived from the original (PDF) on 2016-03-03, retrieved 2015-04-16.

utah.edu (Global: 2,766^th place; English: 1,555^th place)

users.cs.utah.edu

Farach (1997). Farach, Martin (1997), "Optimal Suffix Tree Construction with Large Alphabets" (PDF), 38th IEEE Symposium on Foundations of Computer Science (FOCS '97), pp. 137–143.

uvic.ca (Global: 6,589^th place; English: 3,880^th place)

webhome.cs.uvic.ca

Barsky et al. (2008). Barsky, Marina; Stege, Ulrike; Thomo, Alex; Upton, Chris (2008), "A new method for indexing genomes using on-disk suffix trees", CIKM '08: Proceedings of the 17th ACM Conference on Information and Knowledge Management (PDF), New York, NY, USA: ACM, pp. 649–658.

viu.ca (Global: low place; English: low place)

csci.viu.ca

Barsky et al. (2009). Barsky, Marina; Stege, Ulrike; Thomo, Alex; Upton, Chris (2009), "Suffix trees for very large genomic sequences", CIKM '09: Proceedings of the 18th ACM Conference on Information and Knowledge Management (PDF), New York, NY, USA: ACM.

vldb.org (Global: low place; English: low place)

Tata, Hankins & Patel (2003). Tata, Sandeep; Hankins, Richard A.; Patel, Jignesh M. (2003), "Practical Suffix Tree Construction", VLDB '03: Proceedings of the 30th International Conference on Very Large Data Bases (PDF), Morgan Kaufmann, pp. 36–47.
Mansour et al. (2011). Mansour, Essam; Allam, Amin; Skiadopoulos, Spiros; Kalnis, Panos (2011), "ERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings" (PDF), Proceedings of the VLDB Endowment, 5 (1): 49–60, arXiv:1109.6884, Bibcode:2011arXiv1109.6884M, doi:10.14778/2047485.2047490, S2CID 7582116.

web.archive.org (Global: 1^st place; English: 1^st place)

Knuth conjectured in 1970 that the problem could not be solved in linear time.^[1] In 1973, this was refuted by Weiner's suffix-tree algorithm Weiner (1973). Weiner, P. (1973), "Linear pattern matching algorithms" (PDF), 14th Annual IEEE Symposium on Switching and Automata Theory, pp. 1–11, doi:10.1109/SWAT.1973.13, archived from the original (PDF) on 2016-03-03, retrieved 2015-04-16.
Giegerich & Kurtz (1997). Giegerich, R.; Kurtz, S. (1997), "From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction" (PDF), Algorithmica, 19 (3): 331–353, doi:10.1007/PL00009177, S2CID 18039097, archived from the original (PDF) on 2016-03-03, retrieved 2012-07-13.
Allison, L. "Suffix Trees". Archived from the original on 2008-10-13. Retrieved 2008-10-14.

Suffix tree (English Wikipedia)

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

allisons.org (Global: low place; English: low place)

arxiv.org (Global: 49th place; English: 31st place)

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

jhu.edu (Global: 560th place; English: 313th place)

cs.jhu.edu

psu.edu (Global: 299th place; English: 159th place)

citeseerx.ist.psu.edu

purdue.edu (Global: 1,391st place; English: 979th place)

docs.lib.purdue.edu

rutgers.edu (Global: 2,011th place; English: 1,139th place)

people.cs.rutgers.edu

sciencedirect.com (Global: 137th place; English: 146th place)

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

api.semanticscholar.org

uni-hamburg.de (Global: 3,375th place; English: 4,648th place)

europa.zbh.uni-hamburg.de

unice.fr (Global: low place; English: low place)

airelles.i3s.unice.fr

utah.edu (Global: 2,766th place; English: 1,555th place)

users.cs.utah.edu

uvic.ca (Global: 6,589th place; English: 3,880th place)

webhome.cs.uvic.ca

viu.ca (Global: low place; English: low place)

csci.viu.ca

vldb.org (Global: low place; English: low place)

web.archive.org (Global: 1st place; English: 1st place)

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

arxiv.org (Global: 49^th place; English: 31^st place)

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

jhu.edu (Global: 560^th place; English: 313^th place)

psu.edu (Global: 299^th place; English: 159^th place)

purdue.edu (Global: 1,391^st place; English: 979^th place)

rutgers.edu (Global: 2,011^th place; English: 1,139^th place)

sciencedirect.com (Global: 137^th place; English: 146^th place)

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

uni-hamburg.de (Global: 3,375^th place; English: 4,648^th place)

utah.edu (Global: 2,766^th place; English: 1,555^th place)

uvic.ca (Global: 6,589^th place; English: 3,880^th place)

web.archive.org (Global: 1^st place; English: 1^st place)