Edit Distance with Move Operations

@inproceedings{Shapira2002EditDW,
  title={Edit Distance with Move Operations},
  author={Dana Shapira and James A. Storer},
  booktitle={CPM},
  year={2002}
}
The traditional edit-distance problem is to find the minimum number of insert-character and delete-character (and sometimes change character) operations required to transform one string into another. Here we consider the more general problem of strings being represented by a singly linked list (one character per node) and being able to apply these… CONTINUE READING

2 Figures & Tables

Topics

Statistics

0510'03'05'07'09'11'13'15'17
Citations per Year

90 Citations

Semantic Scholar estimates that this publication has 90 citations based on the available data.

See our FAQ for additional information.