activity
20132026
most citedl-path vertex cover is easier than l-hitting set for small l

2 citations · 8 across the 13 of their papers we have counts for

collaborators
Showing 2013Show all

2 papers · 1 filter

cs.DS2013★ 1 cited

Succinct representation of labeled trees

Dekel Tsur

We give a representation for labeled ordered trees that supports labeled queries such as finding the i-th ancestor of a node with a given label. Our representation is succinct, nam…

cs.DS2013

Approximate String Matching using a Bidirectional Index

Gregory Kucherov, Kamil Salikhov, Dekel Tsur

We study strategies of approximate pattern matching that exploit bidirectional text indexes, extending and generalizing ideas of Lam et al. We introduce a formalism, called search…