Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences

Mustafa Mohamad, David Rappaport, Godfried Toussaint. Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences. Graphs and Combinatorics, 31(5):1637-1648, 2015. [doi]

@article{MohamadRT15,
  title = {Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences},
  author = {Mustafa Mohamad and David Rappaport and Godfried Toussaint},
  year = {2015},
  doi = {10.1007/s00373-014-1467-4},
  url = {http://dx.doi.org/10.1007/s00373-014-1467-4},
  researchr = {https://researchr.org/publication/MohamadRT15},
  cites = {0},
  citedby = {0},
  journal = {Graphs and Combinatorics},
  volume = {31},
  number = {5},
  pages = {1637-1648},
}