37 citations · 67 across the 18 of their papers we have counts for
6 papers · 2 filters
Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding
Debarati Das, Tomasz Kociumaka, Barna Saha
The Dyck language, which consists of well-balanced sequences of parentheses, is one of the most fundamental context-free languages. The Dyck edit distance quantifies the number of…
How Compression and Approximation Affect Efficiency in String Distance Measures
Arun Ganesh, Tomasz Kociumaka, Andrea Lincoln +1
Real-world data often comes in compressed form. Analyzing compressed data directly (without decompressing it) can save space and time by orders of magnitude. In this work, we focus…
Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal
Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer +1
We study the problem of approximating edit distance in sublinear time. This is formalized as the -Gap Edit Distance problem, where the input is a pair of strings and…
Approximating LCS and Alignment Distance over Multiple Sequences
Debarati Das, Barna Saha
We study the problem of aligning multiple sequences with the goal of finding an alignment that either maximizes the number of aligned symbols (the longest common subsequence (LCS))…
Does Preprocessing help in Fast Sequence Comparisons?
Elazar Goldenberg, Aviad Rubinstein, Barna Saha
We study edit distance computation with preprocessing: the preprocessing algorithm acts on each string separately, and then the query algorithm takes as input the two preprocessed…
How to Design Robust Algorithms using Noisy Comparison Oracle
Raghavendra Addanki, Sainyam Galhotra, Barna Saha
Metric based comparison operations such as finding maximum, nearest and farthest neighbor are fundamental to studying various clustering techniques such as -center clustering an…