Tugkan Batu Funda Ergun Cenk Sahinalp  Home/Search
Context Related
| compbio.cs.sfu.ca/publicat...soda06.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: compbio.cs.sfu.ca/publications... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce an oblivious embedding that maps any string of length n to a string of length at most n/r for any user specified value of r. For any given r, our embedding provides a distortion of O(r for some = o(1) under edit distance, which we prove to be (almost) optimal. The embedding can be computed in O(2 n) time. (Update)
Cited by: More
Locally Consistent Parsing and Applications to - Approximate String Comparisons (Correct)
Active bibliography (related documents): More All
1.6: Oblivious String Embeddings and Edit Distance Approximations - Tugkan Batu Funda (2005) (Correct)
0.6: Low Distortion Embeddings for Edit Distance - Ostrovsky, Rabani (2005) (Correct)
0.3: Distance-Sensitive Bloom Filters - Kirsch, Mitzenmacher (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
Tugkan Batu, Funda Ergun, and S. Cenk Sahinalp. Oblivious string embeddings and edit distance approximations. Technical Report TR2005-11, School of Computing Science, Simon Fraser University, 2005. http://citeseer.ist.psu.edu/742561.html More
@misc{ batu05oblivious,
author = "T. Batu and F. Ergun and S. Sahinalp",
title = "Oblivious string embeddings and edit distance approximations",
text = "Tugkan Batu, Funda Ergun, and S. Cenk Sahinalp. Oblivious string embeddings
and edit distance approximations. Technical Report TR2005-11, School of
Computing Science, Simon Fraser University, 2005.",
year = "2005",
url = "citeseer.ist.psu.edu/742561.html" }
Citations (may not include all citations):136 Fast algorithms for finding nearest common ancestors (context) - Harel, Tarjan - 1984
73 A space-economical su#x tree construction algorithm (context) - McCreight - 1976
69 A faster algorithm computing string edit distances (context) - Masek, Paterson - 1980
40 Deterministic coin tossing and accelerating cascades: Micro .. (context) - Cole, Vishkin - 1986
6 Lower bounds for embedding edit distance into normed spaces - Andoni, Deza et al. - 2003
5 A sublinear algorithm for weakly approximating edit distance - Batu, Ergun et al. - 2003
4 Approximating edit distance e#ciently (context) - Bar-Yossef, Jayram et al. - 2004
3 Low distortion embeddings for edit distance - Ostrovsky, Rabani - 2005
3 Data compression using locally consistent parsing (context) - Sahinalp, Vishkin - 1995
3 cient approximate and dynamic matching of patterns using a l.. (context) - Sahinalp, Vishkin - 1996
Documents on the same site (http://compbio.cs.sfu.ca/publications/): More
The Complexity of Gene Placement - Leslie Ann Goldberg (Correct)
The American Genetic Association 92:462--468 - Divergent Origins And (Correct)
Biased Dictionaries with Fast Insert/Deletes - Funda Ergun Cenk (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC