Suffixbaum (German Wikipedia)

Analysis of information sources in references of the Wikipedia article "Suffixbaum" in German language version.

Last modified: 21:21:00, 24 April 2026 (UTC)

Ref.Un. Ref.Website

Global rank German rank

2^nd place

3^rd place

107^th place

5^th place

doi.org (Global: 2^nd place; German: 3^rd place)

Introduction to Suffix Trees. In: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge 1997, ISBN 978-0-521-58519-4, S. 89–93, doi:10.1017/cbo9780511574931.007.
Efficient Data Structures. In: 125 Problems in Text Algorithms: with Solutions. Cambridge University Press, Cambridge 2021, ISBN 978-1-108-83583-1, S. 115–118, doi:10.1017/9781108835831.005.
Peter Weiner: Linear pattern matching algorithms. In: 14th Annual Symposium on Switching and Automata Theory (swat 1973). IEEE, Oktober 1973, S. 1–11, doi:10.1109/swat.1973.13.
Edward M. McCreight: A Space-Economical Suffix Tree Construction Algorithm. In: J. ACM. Band 23, Nr. 2, 1. April 1976, ISSN 0004-5411, S. 262–272, doi:10.1145/321941.321946.
E. Ukkonen: On-line construction of suffix trees. In: Algorithmica. Band 14, Nr. 3, 1. September 1995, ISSN 1432-0541, S. 249–260, doi:10.1007/BF01206331.
R. Giegerich, S. Kurtz: From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction. In: Algorithmica. Band 19, Nr. 3, 1. November 1997, ISSN 1432-0541, S. 331–353, doi:10.1007/PL00009177.
M. Farach: Optimal suffix tree construction with large alphabets. IEEE Comput. Soc, 1997, ISBN 978-0-8186-8197-4, S. 137–143, doi:10.1109/SFCS.1997.646102.

Edward M. McCreight: A Space-Economical Suffix Tree Construction Algorithm. In: J. ACM. Band 23, Nr. 2, 1. April 1976, ISSN 0004-5411, S. 262–272, doi:10.1145/321941.321946.
E. Ukkonen: On-line construction of suffix trees. In: Algorithmica. Band 14, Nr. 3, 1. September 1995, ISSN 1432-0541, S. 249–260, doi:10.1007/BF01206331.
R. Giegerich, S. Kurtz: From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction. In: Algorithmica. Band 19, Nr. 3, 1. November 1997, ISSN 1432-0541, S. 331–353, doi:10.1007/PL00009177.