Efficient Computations of ::::l::::::1:: and ::::l::::::infinity:: Rearrangement Distances

Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat. Efficient Computations of ::::l::::::1:: and ::::l::::::infinity:: Rearrangement Distances. In Nivio Ziviani, Ricardo A. Baeza-Yates, editors, String Processing and Information Retrieval, 14th International Symposium, SPIRE 2007, Santiago, Chile, October 29-31, 2007, Proceedings. Volume 4726 of Lecture Notes in Computer Science, pages 39-49, Springer, 2007. [doi]

@inproceedings{AmirAILP07,
  title = {Efficient Computations of ::::l::::::1:: and ::::l::::::infinity:: Rearrangement Distances},
  author = {Amihood Amir and Yonatan Aumann and Piotr Indyk and Avivit Levy and Ely Porat},
  year = {2007},
  doi = {10.1007/978-3-540-75530-2_4},
  url = {http://dx.doi.org/10.1007/978-3-540-75530-2_4},
  researchr = {https://researchr.org/publication/AmirAILP07},
  cites = {0},
  citedby = {0},
  pages = {39-49},
  booktitle = {String Processing and Information Retrieval, 14th International Symposium, SPIRE 2007, Santiago, Chile, October 29-31, 2007, Proceedings},
  editor = {Nivio Ziviani and Ricardo A. Baeza-Yates},
  volume = {4726},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-75529-6},
}