Dr. Samah Ghazawi
Algorithyms, Data Structures, and Combinatorics in Stringology
Research of algorithms and combinatorics studies applied to strings, both in their one dimensional (1D) and two-dimensional (2D) forms, is denoted by the term “stringology” that was coined by Zvi Galil in 1985 . The importance of stringology lies in its ability to aid in the understanding, manipulation, and extraction of insights from strings of characters. It uncovers hidden patterns, simplifies data handling, and propels progress in various domains where character sequences play a crucial role in understanding and advancement of the domain. Consequently, a range of fields utilizes the outcomes of stringology, including but not limited to, information retrieval, computer vision, computational biology, bioinformatics, natural language processing, and cryptography. Moreover, techniques and algorithms in the domain of stringology are of critical importance in tackling wide practical challenges and uses. Prominent examples of these applications include DNA and RNA analysis, data compression, spell-checking tools, spam filters, search engines, plagiarism detection, code analysis, compilation, and information retrieval systems.
Our research in stringology combines algorithmic and combinatorial aspects of stringology.
