37 citations · 64 across the 15 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DS2021
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))…
cs.DS2021
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…
cs.DS2021
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…