Segui
Sharma V. Thankachan
Sharma V. Thankachan
North Carolina State University
Email verificata su ncsu.edu - Home page
Titolo
Citata da
Citata da
Anno
Inverted indexes for phrases and strings
M Patil, SV Thankachan, R Shah, WK Hon, JS Vitter, S Chandrasekaran
Proceedings of the 34th international ACM SIGIR conference on Research and …, 2011
642011
A Provably Efficient Algorithm for the k-Mismatch Average Common Substring Problem
SV Thankachan, A Apostolico, S Aluru
Journal of Computational Biology, 0
50
Space-Efficient Frameworks for Top-k String Retrieval
WK Hon, R Shah, SV Thankachan, JS Vitter
Journal of the ACM (JACM) 61 (2), 1-36, 2014
482014
A greedy alignment-free distance estimator for phylogenetic inference
SV Thankachan, SP Chockalingam, Y Liu, A Krishnan, S Aluru
BMC bioinformatics 18, 1-8, 2017
432017
On the hardness and inapproximability of recognizing wheeler graphs
D Gibney, SV Thankachan
arXiv preprint arXiv:1902.01960, 2019
362019
String retrieval for multi-pattern queries
WK Hon, R Shah, SV Thankachan, JS Vitter
International Symposium on String Processing and Information Retrieval, 55-66, 2010
362010
Faster compressed dictionary matching
WK Hon, TH Ku, R Shah, SV Thankachan, JS Vitter
Theoretical Computer Science 475, 113-119, 2013
352013
On the complexity of BWT-runs minimization via alphabet reordering
J Bentley, D Gibney, SV Thankachan
arXiv preprint arXiv:1911.03035, 2019
332019
ALFRED: a practical method for alignment-free distance computation
SV Thankachan, SP Chockalingam, Y Liu, A Apostolico, S Aluru
Journal of Computational Biology 23 (6), 452-460, 2016
322016
pBWT: Achieving succinct data structures for parameterized pattern matching and related problems
A Ganguly, R Shah, SV Thankachan
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
312017
Algorithmic framework for approximate matching under bounded edits with applications to sequence analysis
SV Thankachan, C Aluru, SP Chockalingam, S Aluru
Research in Computational Molecular Biology: 22nd Annual International …, 2018
292018
On hardness of several string indexing problems
KG Larsen, JI Munro, JS Nielsen, SV Thankachan
Theoretical Computer Science 582, 74-82, 2015
292015
Top-k Document Retrieval in External Memory
R Shah, C Sheng, SV Thankachan, JS Vitter
European Symposium on Algorithms, 803-814, 2013
292013
Faster compressed top-k document retrieval
WK Hon, SV Thankachan, R Shah, JS Vitter
2013 Data Compression Conference, 341-350, 2013
272013
Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval
WK Hon, R Shah, SV Thankachan
Annual Symposium on Combinatorial Pattern Matching, 173-184, 2012
262012
Categorical range maxima queries
M Patil, SV Thankachan, R Shah, Y Nekrich, JS Vitter
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of …, 2014
252014
Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism∗
D Gibney, G Hoppenworth, S V. Thankachan
Symposium on Simplicity in Algorithms (SOSA), 232-242, 2021
232021
Efficient alignment free sequence comparison with bounded mismatches
S Aluru, A Apostolico, SV Thankachan
International conference on research in computational molecular biology, 1-12, 2015
232015
Document listing for queries with excluded pattern
WK Hon, R Shah, SV Thankachan, JS Vitter
Annual Symposium on Combinatorial Pattern Matching, 185-195, 2012
222012
On entropy-compressed text indexing in external memory
WK Hon, R Shah, SV Thankachan, JS Vitter
International Symposium on String Processing and Information Retrieval, 75-89, 2009
222009
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20