Dr. Paniz Abedin joined IM体育官网 as an assistant professor of
computer science in spring 2022. Before joining IM体育官网 Poly, she was a graduate teaching
and research assistant at the University of Central IM体育官网. She completed her Ph.D.
in computer science under the supervision of Dr. Sharma Thankachan at UCF in 2021.
Abedin鈥檚 research areas are algorithms on strings and compressed data structures with
applications to computational biology.
David T. and Jane M. Donaldson Memorial Scholarship
Doctoral Research Support Award
Ph.D. in Computer Science, University of Central IM体育官网, 2021
M.S. in Computer Science, University of Central IM体育官网, 2020
B.S. in Applied Mathematics, Sharif University of Technology, 2015
Algorithms on Strings
Compact Data Structures
Text Indexing
Bioinformatics
Research and development software engineer, Atos
Graduate research/teaching assistant, University of Central IM体育官网
Machine learning research and development Intern, Atos Syntel Inc
Reviewer/subreviewer for multiple computer science conferences and journals such as
SODA, RECOMB, ISAAC, IWOCA, CPM, ICCABS, ESA, CPM, WABI, SPIRE, JDA
Abedin, P., Hooshmand, S., Ganguly, A., & Thankachan, S. V. (2018). The heaviest induced
ancestors problem revisited. In Annual Symposium on Combinatorial Pattern Matching (CPM 2018)
Abedin, P., Ganguly, A., Hon, W. K., Matsuda, K., Nekrich, Y., Sadakane, K., ... &
Thankachan, S. V. (2020). A linear-space data structure for range-LCP queries in poly-logarithmic
time. Theoretical Computer Science, 822, 15-22.
Abedin, P., Ganguly, A., Pissis, S. P., & Thankachan, S. V. (2019, October). Range
shortest unique substring queries. In International Symposium on String Processing and Information Retrieval (pp. 258-266). Springer, Cham.
Hooshmand, S., Abedin, P., K眉lekci, M. O., & Thankachan, S. V. (2021). I/O-efficient
data structures for non-overlapping indexing. Theoretical Computer Science, 857, 1-7.
Hooshmand, S., Tavakoli, N., Abedin, P., & Thankachan, S. V. (2018). On computing
average common substring over run length encoded sequences. Fundamenta Informaticae, 163(3), 267-273.
Hooshmand, S., Abedin, P., K眉lekci, M. O., & Thankachan, S. V. (2018). Non-Overlapping
Indexing-Cache Obliviously. In Annual Symposium on Combinatorial Pattern Matching (CPM 2018
Abedin, P., Ganguly, A., Pissis, S. P., & Thankachan, S. V. (2020). Efficient data
structures for range shortest unique substring queries. Algorithms, 13(11), 276.
Hooshmand, S., Abedin, P., Gibney, D., Aluru, S., & Thankachan, S. V. (2018, August).
Faster computation of genome mappability. In Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational
Biology, and Health Informatics (pp. 537-537).
Abedin, P., Akbari, S., Demange, M., & Ekim, T. (2017). Complexity of the Improper
Twin Edge Coloring of Graphs. Graphs and Combinatorics, 33(4), 595-615.
*External, third-party sites not maintained by IM体育官网
