
A Simple Algorithm for MultipleSource Shortest Paths in Planar Digraphs
Given an nvertex planar embedded digraph G with nonnegative edge weigh...
read it

Approximating LCS and Alignment Distance over Multiple Sequences
We study the problem of aligning multiple sequences with the goal of fin...
read it

Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor
We consider the numerical taxonomy problem of fitting a positive distanc...
read it

Approximate Trace Reconstruction via Median String (in AverageCase)
We consider an approximate version of the trace reconstruction problem, ...
read it

A LinearTime n^0.4Approximation for Longest Common Subsequence
We consider the classic problem of computing the Longest Common Subseque...
read it

Approximating the Median under the Ulam Metric
We study approximation algorithms for variants of the median string prob...
read it

No Repetition: Fast Streaming with Highly Concentrated Hashing
To get estimators that work within a certain error bound with high proba...
read it

Approximating Edit Distance Within Constant Factor in Truly SubQuadratic Time
Edit distance is a measure of similarity of two strings based on the min...
read it

Approximate Online Pattern Matching in Sublinear Time
We consider the approximate pattern matching problem under edit distance...
read it

Lower bounds for Combinatorial Algorithms for Boolean Matrix Multiplication
In this paper we propose models of combinatorial algorithms for the Bool...
read it

Optimal QuasiGray Codes: Does the Alphabet Matter?
A quasiGray code of dimension n and length ℓ over an alphabet Σ is a se...
read it
Debarati Das
is this you? claim profile