E-LIB Suche - Ergebnisse für: Thankachan, Sharma V.

1

Non-overlapping Indexing in BWT-Runs Bounded Space:

, In: String Processing and Information Retrieval; Lecture Notes in Computer Science,

Gibney, Daniel ; Macnichol, Paul ; Thankachan, Sharma V. - p. 260-270 , 2023

Link: https://doi.org/10.1007/..

2

Contextual Pattern Matching in Less Space:

, In: 2023 Data Compression Conference (DCC),

Abedin, Paniz ; Chubet, Oliver ; Gibney, Daniel. - p. 160-167 , 2023

Link: https://doi.org/10.1109/..

3

Co-linear Chaining with Overlaps and Gap Costs:

, In: Lecture Notes in Computer Science; Research in Computational Molecular Biology,

Jain, Chirag ; Gibney, Daniel ; Thankachan, Sharma V. - p. 246-262 , 2022

Link: https://doi.org/10.1007/..

4

Memory–Efficient FM-Index Construction for Reference Genome:

, In: 2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM),

Das, Arghya Kusum ; Kulekci, M. Oguzhan ; Thankachan, Sharma V. - p. 736-739 , 2022

Link: https://doi.org/10.1109/..

5

The Heaviest Induced Ancestors Problem: Better Data Structu..:

Abedin, Paniz ; Hooshmand, Sahar ; Ganguly, Arnab.
Algorithmica. 84 (2022) 7 - p. 2088-2105 , 2022

Link: https://doi.org/10.1007/..

6

On the Complexity of Recognizing Wheeler Graphs:

Gibney, Daniel ; Thankachan, Sharma V.
Algorithmica. 84 (2022) 3 - p. 784-814 , 2022

Link: https://doi.org/10.1007/..

7

The Complexity of Approximate Pattern Matching on de Bruijn..:

, In: Lecture Notes in Computer Science; Research in Computational Molecular Biology,

Gibney, Daniel ; Thankachan, Sharma V. ; Aluru, Srinivas - p. 263-278 , 2022

Link: https://doi.org/10.1007/..

8

Quantum Time Complexity and Algorithms for Pattern Matching..:

, In: String Processing and Information Retrieval; Lecture Notes in Computer Science,

Darbari, Parisa ; Gibney, Daniel ; Thankachan, Sharma V. - p. 303-314 , 2022

Link: https://doi.org/10.1007/..

9

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

Hooshmand, Sahar ; Abedin, Paniz ; Oğuzhan Külekci, M..
Theoretical Computer Science. 857 (2021) - p. 1-7 , 2021

Link: https://doi.org/10.1016/..

10

A framework for designing space-efficient dictionaries for ..:

Ganguly, Arnab ; Hon, Wing-Kai ; Sadakane, Kunihiko...
Theoretical Computer Science. 854 (2021) - p. 52-62 , 2021

Link: https://doi.org/10.1016/..

11

Text Indexing for Regular Expression Matching:

Gibney, Daniel ; Thankachan, Sharma V.
Algorithms. 14 (2021) 5 - p. 133 , 2021

Link: https://doi.org/10.3390/..

12

I/O-optimal categorical 3-sided skyline queries:

Ganguly, Arnab ; Gibney, Daniel ; Thankachan, Sharma V..
Theoretical Computer Science. 896 (2021) - p. 132-144 , 2021

Link: https://doi.org/10.1016/..

13

A brief history of parameterized matching problems:

Mendivelso, Juan ; Thankachan, Sharma V. ; Pinzón, Yoan
Discrete Applied Mathematics. 274 (2020) - p. 103-115 , 2020

Link: https://doi.org/10.1016/..

14

Sequential and parallel algorithms for all-pairk-mismatch m..:

Chockalingam, Sriram P. ; Thankachan, Sharma V. ; Aluru, Srinivas
Journal of Parallel and Distributed Computing. 144 (2020) - p. 68-79 , 2020

Link: https://doi.org/10.1016/..

15

An alignment-free heuristic for fast sequence comparisons w..:

Chockalingam, Sriram P. ; Pannu, Jodh ; Hooshmand, Sahar..
BMC Bioinformatics. 21 (2020) S6 - p. , 2020

Link: https://doi.org/10.1186/..