Dr Golnaz Badkobeh
Staff details
Golnaz is a Senior Lecturer in Computing and the Director of the Postgraduate Research. She is also the gender equality lead of Computing.
Prior to joining Goldsmiths, Golnaz was a Leverhulme Fellow at the University of Warwick. Her project titled " Scalable Indexing and Compression: Algorithms and Combinatorics".
Golnaz held a postdoctoral fellowship in Evolutionary Algorithms at the University of Sheffield in 2014/15, where her work focused on aspects of random search and structured population search.
Golnaz's research has two main themes: combinatorial aspects of repetition in sequential data, and algorithmic and data structural problems in string processing. Her most significant research contribution to date is a series of intricate combinatorial results concerning pattern avoidance and strong constraints on strings. This is of crucial importance in data science in particular for designing efficient pattern matching methods and text compression techniques.
Academic qualifications
- PhD Informatics - King's college London 2013
- BSc Mathematics - University of Bristol 2008
Publications and research outputs
Article
Badkobeh, Golnaz; De Luca, Alessandro; Fici, Gabriele and Puglisi, Simon J.. 2022. Maximal Closed Substrings. Lecture Notes in Computer Science, 13617, pp. 16-23. ISSN 0302-9743
Badkobeh, Golnaz; Charalampopoulos, Panagiotis; Kosolobov, Dmitry and Pissis, Solon P.. 2022. Internal shortest absent word queries in constant time and linear space. Theoretical Computer Science, 922, pp. 271-282. ISSN 0304-3975
Badkobeh, Golnaz; Harju, Tero; Ochem, Pascal and Rosenfeld, Matthieu. 2022. Avoiding square-free words on free groups. Theoretical Computer Science, ISSN 0304-3975
Badkobeh, Golnaz and Crochemore, Maxime. 2022. Linear Construction of a Left Lyndon Tree. Information and Computation, 285(B), 104884. ISSN 0890-5401
Badkobeh, Golnaz; Charalampopoulos, Panagiotis and Pissis, Solon P.. 2021. Internal Shortest Absent Word Queries. 32nd Annual Symposium on Combinatorial Pattern Matching,
Badkobeh, Golnaz; Gawrychowski, Pawel; Kärkkäinen, Juha; Puglisi, Simon J. and Zhukova, Bella. 2021. Tight Upper and Lower Bounds on Suffix Tree Breadth. Theoretical Computer Science, 854, pp. 63-67. ISSN 0304-3975
Ayad, Lorraine A. K.; Badkobeh, Golnaz; Fici, Gabriele; Heliou, Alice and Pissis, Solon P.. 2020. Constructing Antidictionaries of Long Texts in Output-Sensitive Space. Theory of Computing Systems(176 Co), pp. 1-21. ISSN 1432-4350
Badkobeh, Golnaz and Crochemore, Maxime. 2020. Left Lyndon tree construction. Prague Stringology, pp. 84-95.
Badkobeh, Golnaz and Ochem, Pascal. 2020. Avoiding conjugacy classes on the 5-letter alphabet. RAIRO: Theoretical Informatics and Applications, 54(2), pp. 1-4. ISSN 0988-3754
Badkobeh, Golnaz; Bannai, Hideo; Crochemore, Maxime; I, Tomohiro; Inenaga, shunsuke and Sugimoto, Shiho. 2019. k-Abelian pattern matching: Revisited, corrected, and extended. pp. 29-40.
Ayad, Lorraine A. K.; Badkobeh, Golnaz; Fici, Gabriele; Heliou, Alice and Pissis, Solon P.. 2019. Constructing Antidictionaries in Output-Sensitive Space. pp. 538-547. ISSN 2375-0359
Badkobeh, Golnaz; Fici, Gabriele and Puglisi, Simon. 2018. Algorithms for Anti-Powers in Strings. Information Processing Letters, 137, pp. 57-60. ISSN 0020-0190
Badkobeh, Golnaz; Gagie, Travis; Inenaga, shunsuke; Kociumaka, Tomasz; Kosolobov, Dmitry and Puglisi, Simon. 2017. On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. Lecture Notes in Computer Science, 1058, pp. 51-67. ISSN 0302-9743
Badkobeh, Golnaz; Karkkainen, Juha; Puglisi, Simon and Zhukova, Bella. 2017. On Suffix Tree Breadth. Lecture Notes in Computer Science, 1058, pp. 68-73. ISSN 0302-9743
Badkobeh, Golnaz; Crochemore, Maxime and Mercas, Robert. 2017. Counting Maximal-Exponent Factors in Words. Theoretical Computer Science, 658(A), pp. 27-35. ISSN 0304-3975
Badkobeh, Golnaz; Crochemore, Maxime; Mohamed, Manal and Toopsuwan, Chalita. 2016. Efficient Computation of Maximal Anti-Exponent in Palindrome-Free Strings. Theoretical Computer Science, 656(B), pp. 241-248. ISSN 0304-3975
Badkobeh, Golnaz; Bannai, Hideo; Goto, Keisuke; Inenaga, shunsuke; Sugimoto, Shiho; I, Tomohiro; Iliopoulos, Costas and Puglisi, Simon. 2016. Closed Factorization. Discrete Applied Mathematics, 212, pp. 23-29. ISSN 0166-218X
Badkobeh, Golnaz; Gagie, Travis; Grabowski, Szymon; Nakashima, Yuto; Puglisi, Simon and Sugimoto, Shiho. 2016. Longest Common Abelian Factors and Large Alphabets. International Symposium on String Processing and Information Retrieval (SPIRE), pp. 254-259.
Badkobeh, Golnaz and Crochemore, Maxime. 2016. Computing maximal-exponent factors in an overlap-free word. Journal of Computer and System Sciences, 82(3), pp. 477-487. ISSN 0022-0000
Paixão, Tiago; Badkobeh, Golnaz; Barton, Nick; Çörüş, Doğan; Dang, Duc-Cuong; Friedrich, Tobias; Lehre, Per Kristian; Sudholt, Dirk; Sutton, Andrew M. and Trubenová, Barbora. 2015. Toward a unifying framework for evolutionary processes. Journal of Theoretical Biology, 383, pp. 28-43. ISSN 0022-5193
Badkobeh, Golnaz and Ochem, Pascal. 2015. Characterization of some binary words with few squares. Theoretical Computer Science, 588, pp. 73-80. ISSN 0304-3975
Badkobeh, Golnaz; Fici, Gabriele and Lipták, Zsuzsanna. 2015. On the Number of Closed Factors in a Word. pp. 381-390.
Badkobeh, Golnaz and Crochemore, Maxime. 2015. Infinite binary words containing repetitions of odd period. Information Processing Letters, 115(5), pp. 543-547. ISSN 0020-0190
Conference or Workshop Item
Badkobeh, Golnaz; Giuliani, Sara; Lipták, Zsuzsanna and Puglisi, Simon J.. 2022. 'On Compressing Collections of Substring Samples'. In: 23rd Italian Conference on Theoretical Computer Science (ICTCS 2022). Rome, Italy 7-9 September 2022.
Badkobeh, Golnaz; Crochemore, Maxime; Ellert, Jonas and Nicaud, Cyril. 2022. 'Back-to-Front Online Lyndon Forest Construction'. In: 33rd Annual Symposium on Combinatorial Pattern Matching. Prague, Czech Republic 27–29 June 2022.
Alamro, Hayam; Badkobeh, Golnaz; Belazzougui, Djamal; Iliopoulos, Costas S. and Puglisi, Simon J.. 2019. 'Computing the Antiperiod(s) of a String'. In: 30th Annual Symposium on Combinatorial Pattern Matching. Pisa, Italy 18-20 June 2019.
Crawford, Tim; Badkobeh, Golnaz and Lewis, David. 2018. 'Searching Page-Images of Early Music Scanned with OMR: A Scalable Solution Using Minimal Absent Words'. In: 19th International Society for Music Information Retrieval Conference. Paris, France 24-27 September 2018.
Crawford, Tim; Badkobeh, Golnaz and Lewis, David. 2018. 'Searching Page-Images of Early Music Scanned with OMR: A Scalable Solution Using Minimal Absent Words'. In: Proceedings of the 19th International Society for Music Information Retrieval Conference, ISMIR 2018, Paris, France, September 23-27, 2018. Paris, France 23 – 27 September 2018.
Badkobeh, Golnaz; Lehre, Per Kristian and Sudholt, Dirk. 2015. 'Black-box Complexity of Parallel Search with Distributed Populations'. In: Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17 - 20, 2015. Aberystwyth, United Kingdom.
Further profile content
Featured publications
2021: Constructing Antidictionaries of Long Texts in Output-Sensitive Space
2021: Tight upper and lower bounds on suffix tree breadth
2020: Avoiding conjugacy classes on the 5-letter alphabet
2019: k-Abelian Pattern Matching: Revisited, Corrected, and Extended.
2019: Computing the antiperiod (s) of a string
