Sharma V. Thankachan

According to our database1, Sharma V. Thankachan authored at least 94 papers between 2009 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Ranked document selection.
Theor. Comput. Sci., 2020

A brief history of parameterized matching problems.
Discret. Appl. Math., 2020

Succinct Non-overlapping Indexing.
Algorithmica, 2020

2019
On the Complexity of BWT-runs Minimization via Alphabet Reordering.
CoRR, 2019

Range Shortest Unique Substring Queries.
Proceedings of the String Processing and Information Retrieval, 2019

Categorical Range Reporting with Frequencies.
Proceedings of the 22nd International Conference on Database Theory, 2019

On the Hardness and Inapproximability of Recognizing Wheeler Graphs.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Parameterized Text Indexing with One Wildcard.
Proceedings of the Data Compression Conference, 2019

2018
Ranked document retrieval for multiple patterns.
Theor. Comput. Sci., 2018

Space-efficient indexes for forbidden extension queries.
J. Discrete Algorithms, 2018

On Computing Average Common Substring Over Run Length Encoded Sequences.
Fundam. Inform., 2018

A Linear Space Data Structure for Range LCP Queries.
Fundam. Inform., 2018

Dictionary Matching with a Bounded Gap in Pattern or in Text.
Algorithmica, 2018

Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis.
Proceedings of the Research in Computational Molecular Biology, 2018

Faster Computation of Genome Mappability with one Mismatch.
Proceedings of the 8th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2018

Compact Encoding for Galled-Trees and Its Applications.
Proceedings of the 2018 Data Compression Conference, 2018

Non-Overlapping Indexing - Cache Obliviously.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

The Heaviest Induced Ancestors Problem Revisited.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

An Alignment-free Heuristic for Fast Sequence Comparisons with Applications to Phylogeny Reconstruction.
Proceedings of the 2018 ACM International Conference on Bioinformatics, 2018

Faster Computation of Genome Mappability.
Proceedings of the 2018 ACM International Conference on Bioinformatics, 2018

Diagnosing Schizophrenia: A Deep Learning Approach.
Proceedings of the 2018 ACM International Conference on Bioinformatics, 2018

A Practical and Efficient Algorithm for the k-mismatch Shortest Unique Substring Finding Problem.
Proceedings of the 2018 ACM International Conference on Bioinformatics, 2018

2017
In-place algorithms for exact and approximate shortest unique substring problems.
Theor. Comput. Sci., 2017

Space-time trade-offs for finding shortest unique substrings and maximal unique matches.
Theor. Comput. Sci., 2017

Range selection and predecessor queries in data aware space and time.
J. Discrete Algorithms, 2017

Position-restricted substring searching over small alphabets.
J. Discrete Algorithms, 2017

A greedy alignment-free distance estimator for phylogenetic inference.
BMC Bioinformatics, 2017

Top-k Term-Proximity in Succinct Space.
Algorithmica, 2017

pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Structural Pattern Matching - Succinctly.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016
Compressed Document Retrieval on String Collections.
Encyclopedia of Algorithms, 2016

Reporting consecutive substring occurrences under bounded gap constraints.
Theor. Comput. Sci., 2016

Document retrieval with one wildcard.
Theor. Comput. Sci., 2016

ALFRED: A Practical Method for Alignment-Free Distance Computation.
Journal of Computational Biology, 2016

A Provably Efficient Algorithm for the k-Mismatch Average Common Substring Problem.
Journal of Computational Biology, 2016

Parameterized Pattern Matching - Succinctly.
CoRR, 2016

Optimal Encodings for Range Majority Queries.
Algorithmica, 2016

Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees.
Algorithmica, 2016

A parallel algorithm for finding all pairs k-mismatch maximal common substrings.
Proceedings of the International Conference for High Performance Computing, 2016

An Efficient Algorithm for Finding All Pairs k-Mismatch Maximal Common Substrings.
Proceedings of the Bioinformatics Research and Applications - 12th International Symposium, 2016

Space-Time Trade-Offs for the Shortest Unique Substring Problem.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Probabilistic Threshold Indexing for Uncertain Strings.
Proceedings of the 19th International Conference on Extending Database Technology, 2016

Space-Efficient Dictionaries for Parameterized and Order-Preserving Pattern Matching.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015
On hardness of several string indexing problems.
Theor. Comput. Sci., 2015

Low space data structures for geometric range mode query.
Theor. Comput. Sci., 2015

Succinct indexes for reporting discriminating and generic words.
Theor. Comput. Sci., 2015

Bottom-k document retrieval.
J. Discrete Algorithms, 2015

Compressing Dictionary Matching Index via Sparsification Technique.
Algorithmica, 2015

Geometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching.
Algorithmica, 2015

Range LCP Queries Revisited.
Proceedings of the String Processing and Information Retrieval, 2015

Efficient Alignment Free Sequence Comparison with Bounded Mismatches.
Proceedings of the Research in Computational Molecular Biology, 2015

An In-place Framework for Exact and Approximate Shortest Unique Substring Queries.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Shared-Constraint Range Reporting.
Proceedings of the 18th International Conference on Database Theory, 2015

A greedy alignment-free distance estimator for phylogenetic inference (extended abstract).
Proceedings of the 5th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2015

Efficient detection of viral transmission with threshold-based methods.
Proceedings of the 5th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2015

Forbidden Extension Queries.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Range Selection Queries in Data Aware Space and Time.
Proceedings of the 2015 Data Compression Conference, 2015

Dictionary Matching with Uneven Gaps.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Ranked Document Retrieval with Forbidden Pattern.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Range Counting with Distinct Constraints.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
New space/time tradeoffs for top-k document retrieval on sequences.
Theor. Comput. Sci., 2014

Less space: Indexing for queries with wildcards.
Theor. Comput. Sci., 2014

Space-Efficient Frameworks for Top-k String Retrieval.
J. ACM, 2014

Categorical range maxima queries.
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

Encodings for Range Majority Queries.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

Indexed Geometric Jumbled Pattern Matching.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013
Faster compressed dictionary matching.
Theor. Comput. Sci., 2013

Compressed text indexing with wildcards.
J. Discrete Algorithms, 2013

Compressed property suffix trees.
Inf. Comput., 2013

Faster Range LCP Queries.
Proceedings of the String Processing and Information Retrieval, 2013

Faster Top-k Document Retrieval in Optimal Space.
Proceedings of the String Processing and Information Retrieval, 2013

Top-k Color Queries on Tree Paths.
Proceedings of the String Processing and Information Retrieval, 2013

Top-k Document Retrieval in Compact Space and Near-Optimal Time.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Top-k join queries: overcoming the curse of anti-correlation.
Proceedings of the 17th International Database Engineering & Applications Symposium, 2013

Top-k Document Retrieval in External Memory.
Proceedings of the Algorithms - ESA 2013, 2013

Approximate string matching by position restricted alignment.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Faster Compressed Top-k Document Retrieval.
Proceedings of the 2013 Data Compression Conference, 2013

Space-Efficient Construction Algorithm for the Circular Suffix Tree.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

Indexes for Document Retrieval with Relevance.
Proceedings of the Space-Efficient Data Structures, 2013

2012
Succinct representations of weighted trees supporting path queries.
J. Discrete Algorithms, 2012

On position restricted substring searching in succinct space.
J. Discrete Algorithms, 2012

On Optimal Top-K String Retrieval
CoRR, 2012

Document Listing for Queries with Excluded Pattern.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Efficient Algorithm for Circular Burrows-Wheeler Transform.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011
A Truly Dynamic Data Structure for Top-k Queries on Uncertain Data.
Proceedings of the Scientific and Statistical Database Management, 2011

Compressed Indexes for Aligned Pattern Matching.
Proceedings of the String Processing and Information Retrieval, 2011

Inverted indexes for phrases and strings.
Proceedings of the Proceeding of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2011

Succinct Indexes for Circular Patterns.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Compressed Dictionary Matching with One Error.
Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

2010
Fully Dynamic Data Structure for Top-k Queries on Uncertain Data
CoRR, 2010

String Retrieval for Multi-pattern Queries.
Proceedings of the String Processing and Information Retrieval, 2010

2009
On Entropy-Compressed Text Indexing in External Memory.
Proceedings of the String Processing and Information Retrieval, 2009


  Loading...