Near-optimal sublinear time algorithms for Ulam distance

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 76-86

  Andoni, Alexandr ^a   Nguyen, Huy L ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

EDIT DISTANCE; LINEAR TIME; LOWER BOUNDS; NEAR-OPTIMAL; SUBLINEAR TIME ALGORITHMS; TIGHT BOUND; UPPER AND LOWER BOUNDS;

APPROXIMATION ALGORITHMS;

EID: 77951698502     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.8     Document Type: Conference Paper

References (12)

1. [ACCL07] Nir Ailon, Bernard Chazelle, Seshadhri Comandur, and Ding Liu. Estimating the distance to a monotone function. Random Structures and Algorithms, 31:371-383, 2007. Previously appeared in RANDOM'04.
2. 1 non-embeddability barrier: Algorithms for product metrics. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 865-874, 2009.
3. [AJKS02] Miklós Ajtai, T. S. Jayram, Ravi Kumar, and D. Sivakumar. Approximate counting of inversions in a data stream. In Proceedings of the Symposium on Theory of Computing (STOC), pages 370-379, 2002.
4. [AK07] Alexandr Andoni and Robert Krauthgamer. The computational hardness of estimating edit distance. In Proceedings of the Symposium on Foundations of Computer Science (FOCS), pages 724-734, 2007.
5. Accepted to SIAM Journal on Computing (FOCS'07 ).
6. [AK08] Alexandr Andoni and Robert Krauthgamer. The smoothed complexity of edit distance. In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP), pages 357-369, 2008.
7. [AO09] Alexandr Andoni and Krzysztof Onak. Approximating edit distance in near-linear time. In Proceedings of the Symposium on Theory of Computing (STOC), pages 199-204, 2009.
8. +03] Tuǧkan Batu, Funda Ergün, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, and Rahul Sami. A sublinear algorithm for weakly approximating edit distance. In Proceedings of the Symposium on Theory of Computing (STOC), pages 316-324, 2003.
9. [GJKK07] Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, and Ravi Kumar. Estimating the sortedness of a data stream. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 318-327, 2007.
10. 1. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1010-1017, 2006.
11. [Mar95] John I. Marden. Analyzing and Modeling Rank Data. Monographs on Statistics and Applied Probability 64. CRC Press, 1995.
12. [MR95] Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995.