Sharma V. Thankachan

Sharma V. Thankachan

University of Central Florida

H-index: 21

North America-United States

About Sharma V. Thankachan

Sharma V. Thankachan, With an exceptional h-index of 21 and a recent h-index of 14 (since 2020), a distinguished researcher at University of Central Florida, specializes in the field of Algorithms, Data Structures, CompBio.

His recent articles reflect a diverse array of research interests and contributions to the field:

Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization

Ranked Document Retrieval in External Memory

Compressibility-aware quantum algorithms on strings

Non-overlapping Indexing in BWT-Runs Bounded Space

Check for updates Non-overlapping Indexing in BWT-Runs Bounded Space

Suffix-prefix queries on a dictionary

Contextual Pattern Matching in Less Space

On the complexity of recognizing wheeler graphs

Sharma V. Thankachan Information

University

Position

___

Citations(all)

1389

Citations(since 2020)

743

Cited By

974

hIndex(all)

21

hIndex(since 2020)

14

i10Index(all)

50

i10Index(since 2020)

22

Email

University Profile Page

Google Scholar

Sharma V. Thankachan Skills & Research Interests

Algorithms

Data Structures

CompBio

Top articles of Sharma V. Thankachan

Title

Journal

Author(s)

Publication Date

Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization

Daniel Gibney

Ce Jin

Tomasz Kociumaka

Sharma V Thankachan

2024

Ranked Document Retrieval in External Memory

ACM Transactions on Algorithms

Rahul Shah

Cheng Sheng

Sharma Thankachan

Jeffrey Vitter

2023/3/9

Compressibility-aware quantum algorithms on strings

arXiv preprint arXiv:2302.07235

Daniel Gibney

Sharma V Thankachan

2023/2/14

Non-overlapping Indexing in BWT-Runs Bounded Space

Daniel Gibney

Paul Macnichol

Sharma V Thankachan

2023/9/20

Check for updates Non-overlapping Indexing in BWT-Runs Bounded Space

String Processing and Information Retrieval: 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26–28, 2023, Proceedings

Daniel Gibney¹

Paul Macnichol

Sharma V Thankachan

2023/9/19

Suffix-prefix queries on a dictionary

Grigorios Loukides

Solon P Pissis

Sharma V Thankachan

Wiktor Zuba

2023/6/26

Contextual Pattern Matching in Less Space

Paniz Abedin

Oliver Chubet

Daniel Gibney

Sharma V Thankachan

2023/3/21

On the complexity of recognizing wheeler graphs

Algorithmica

Daniel Gibney

Sharma V Thankachan

2022/3

Quantum time complexity and algorithms for pattern matching on labeled graphs

Parisa Darbari

Daniel Gibney

Sharma V Thankachan

2022/11/1

Feasibility of flow decomposition with subpath constraints in linear time

22nd International Workshop on Algorithms in Bioinformatics, Leibniz International Proceedings in Informatics

Daniel Gibney

V Sharma

Srinivas Aluru

2022/1

The heaviest induced ancestors problem: better data structures and applications

Algorithmica

Paniz Abedin

Sahar Hooshmand

Arnab Ganguly

Sharma V Thankachan

2022/7

Compact text indexing for advanced pattern matching problems: parameterized, order-isomorphic, 2D, etc.(invited talk)

Sharma V Thankachan

2022

Fully functional parameterized suffix trees in compact space

49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)

Arnab Ganguly

Rahul Shah

Sharma V Thankachan

2022/6

Memory–Efficient FM-Index Construction for Reference Genomes

Arghya Kusum Das

M Oguzhan Kulekci

Sharma V Thankachan

2022/12/6

The complexity of approximate pattern matching on de Bruijn graphs

Daniel Gibney

Sharma V Thankachan

Srinivas Aluru

2022/4/29

On the hardness of sequence alignment on De Bruijn graphs

Journal of Computational Biology

Daniel Gibney

Sharma V Thankachan

Srinivas Aluru

2022/12/1

Co-linear chaining with overlaps and gap costs

Chirag Jain

Daniel Gibney

Sharma V Thankachan

2022/4/29

Algorithms for colinear chaining with overlaps and gap costs

Journal of Computational Biology

Chirag Jain

Daniel Gibney

Sharma V Thankachan

2022/11/1

I/O-efficient data structures for non-overlapping indexing

Theoretical Computer Science

Sahar Hooshmand

Paniz Abedin

M Oğuzhan Külekci

Sharma V Thankachan

2021/2/12

A framework for designing space-efficient dictionaries for parameterized and order-preserving matching

Theoretical Computer Science

Arnab Ganguly

Wing-Kai Hon

Kunihiko Sadakane

Rahul Shah

Sharma V Thankachan

...

2021/1/16

See List of Professors in Sharma V. Thankachan University(University of Central Florida)

Co-Authors

academic-engine