Follow
Paniz Abedin
Paniz Abedin
Florida Polytechnic University
Verified email at floridapoly.edu - Homepage
Title
Cited by
Cited by
Year
The heaviest induced ancestors problem revisited
P Abedin, S Hooshmand, A Ganguly, SV Thankachan
Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018
132018
A linear-space data structure for range-LCP queries in poly-logarithmic time
P Abedin, A Ganguly, WK Hon, K Matsuda, Y Nekrich, K Sadakane, ...
Theoretical Computer Science 822, 15-22, 2020
92020
A linear-space data structure for range-LCP queries in poly-logarithmic time
P Abedin, A Ganguly, WK Hon, Y Nekrich, K Sadakane, R Shah, ...
COCOON 2018, 2018
92018
Non-overlapping indexing-cache obliviously
S Hooshmand, P Abedin, MO Külekci, SV Thankachan
Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018
62018
A Survey on Shortest Unique Substring Queries
P Abedin, MO Külekci, S V Thankachan
Algorithms 13 (9), 224, 2020
52020
Range shortest unique substring queries
P Abedin, A Ganguly, SP Pissis, SV Thankachan
International Symposium on String Processing and Information Retrieval, 258-266, 2019
52019
Faster computation of genome mappability
S Hooshmand, P Abedin, D Gibney, S Aluru, SV Thankachan
Proceedings of the 2018 ACM International Conference on Bioinformatics …, 2018
52018
On computing average common substring over run length encoded sequences
S Hooshmand, N Tavakoli, P Abedin, SV Thankachan
Fundamenta Informaticae 163 (3), 267-273, 2018
52018
The heaviest induced ancestors problem: better data structures and applications
P Abedin, S Hooshmand, A Ganguly, SV Thankachan
Algorithmica, 1-18, 2022
32022
Efficient data structures for range shortest unique substring queries
P Abedin, A Ganguly, SP Pissis, SV Thankachan
Algorithms 13 (11), 276, 2020
32020
I/O-efficient data structures for non-overlapping indexing
S Hooshmand, P Abedin, MO Külekci, SV Thankachan
Theoretical Computer Science 857, 1-7, 2021
22021
Faster Computation of Genome Mappability with one Mismatch.
S Hooshmand, P Abedin, D Gibney, S Aluru, SV Thankachan
ICCABS, 1, 2018
22018
Complexity of the improper twin edge coloring of graphs
P Abedin, S Akbari, M Demange, T Ekim
Graphs and Combinatorics 33 (4), 595-615, 2017
12017
Analyzing the Data Completeness of Patients’ Records Using a Random Variable Approach to Predict the Incompleteness of Electronic Health Records
VP Gurupur, P Abedin, S Hooshmand, M Shelleh
Applied Sciences 12 (21), 10746, 2022
2022
Efficient Data Structures for Text Processing Applications
P Abedin
2021
Improper Twin Edge Coloring of Graphs
P Abedin, S Akbari, M Demange, T Ekim
arXiv preprint arXiv:1601.02267, 2016
2016
The system can't perform the operation now. Try again later.
Articles 1–16