Sharma Thankachan, Ph.D.

Assistant Professor 

University of Central Florida
Dept. of Computer Science
207
Harris Corporation Engineering Center
4000 Central Florida Blvd.,
Orlando, FL 32816 

 

Email: sharma(dot)thankachan(at)ucf(dot)edu
Phone: 407-823-5316


BioSketch: I am an Assistant Professor in the department of computer science at University of Central Florida since 2017. Before joining UCF, I have worked as a Research Scientist/PostDoc in the School of Computational Science and Engineering, Georgia Institute o f Technology, Atlanta mentored by Prof. Srinivas Aluru and in the Cheriton School of Computer Science, University of Waterloo, Canada mentored by Prof. J. Ian Munro. My Ph.D. is in Computer Science from Louisiana State University (Spring 2014), supervised by Prof. Rahul Shah. My Bachelor degree is in EEE from National Institute of Technology Calicut, India.


Research Areas: Algorithms on Strings/Graphs with Applications to Computational Biology; Compressed/Succinct Data Structures; High Performance Computing.


Selected Publications: The complete list of my publications can be found in DBLP or Google Scholar.

  1. Daniel Gibney, Gary Hoppenworth, and Sharma V. Thankachan:  Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism. SIAM Symposium on Simplicity in Algorithms (SOSA), 2021  [link].
  2. Daniel Gibney and Sharma V. Thankachan:  Finding an Optimal Alphabet Ordering for Lyndon Factorization is Hard. International Symposium on Theoretical Aspects of Computer Science ( STACS ), 2021  [link].
  3. Gary Hoppenworth, Jason Bentley, Daniel Gibney and Sharma V. Thankachan:  Fine-grained Complexity of the Median and Center String Problems under Edits. 28th Annual European Symposium on Algorithms (ESA), 2020 [link].
  4. Jason Bentley, Daniel Gibney and Sharma V. Thankachan:  On the Complexity of BWT-runs Minimization via Alphabet Reordering. 28th Annual European Symposium on Algorithms (ESA), 2020 [link].
  5. Daniel Gibney and Sharma V. Thankachan:  On the Hardness and Inapproximability of Recognizing Wheeler Graphs. 27th Annual European Symposium on Algorithms (ESA), 2019 [link].
  6. Sharma V. Thankachan, Chaitanya Aluru, Sriram P. Chockalingam and Srinivas Aluru: Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis. 22nd Annual International Conference in Research in Computational Molecular Biology (RECOMB), 2018 [link].
  7. Arnab Ganguly, Rahul Shah and Sharma V. Thankachan: pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching, and Related Problems. 28th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2017 [pdf].
  8. Sriram P. Chockalingam, Sharma V. Thankachan and Srinivas Aluru: A parallel algorithm for finding all pairs k-mismatch maximal common substrings. International Conference for High Performance Computing, Networking, Storage and Analysis (Super Computing, SC), 2016 [link].
  9. Srinivas Aluru, Alberto Apostolico and Sharma V. Thankachan: Efficient Alignment Free Sequence Comparison with Bounded Mismatches. 19th Annual International Conference in Research in Computational Molecular Biology (RECOMB), 2015 [link].
  10. Wing-Kai Hon, Rahul Shah and Sharma V. Thankachan, Jeffrey Scott Vitter: Space-Efficient Frameworks for Top-k String Retrieval. Journal of the ACM (JACM), 61(2), 2014 [pdf].

Teaching


Program Committee


Current and Former PhD Students