Permutation Editing and Matching via Embeddings-Reference-Cited by-同舟云学术

Permutation Editing and Matching via Embeddings

Published:2001 Issue: Volume: Page:481-492
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Cormode Graham,Muthukrishnan S.,Sahinalp Süleyman Cenk

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48224-5_40

Reference14 articles.

1. V. Bafna and P. A. Pevzner. Genome rearrangements and sorting by reversals. In Proceedings of the 34th Annual Symposium on Foundations of Comptuer Science, pages 148–157, Palo Alto, CA, 1993. IEEE Computer Society Press.

2. Vineet Bafna and Pavel A. Pevzner. Sorting by transpositions. SIAM Journal on Discrete Mathematics, 11(2):224–240, May 1998.

3. A. Caprara. Sorting by reversals is difficult. In Proceedings of the First International Conference on Computational Molecular Biology, pages 75–83, 1997.

4. David A. Christie. A 3/2-approximation algorithm for sorting by reversals. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 244–252, San Francisco, California, 25-27 January 1998.

5. J. Feigenbaum, S. Kannan, M. Strauss, and M. Viswanathan. An approximate L1-difference algorithm for massive data streams. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 501–511, 1999.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Indexing for Near-Sorted Data;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04

2. Building Comparable Corpora;Building and Using Comparable Corpora for Multilingual Natural Language Processing;2023

3. Stable Distributions in Streaming Computations;Data-Centric Systems and Applications;2016

4. Sketching and Embedding are Equivalent for Norms;Proceedings of the forty-seventh annual ACM symposium on Theory of Computing;2015-06-14

5. Edit Distance to Monotonicity in Sliding Windows;Algorithms and Computation;2011