Minimum Many-to-Many Matchings for Computing the Distance...

Graphs and Combinatorics 2015 / 9 Vol. 31; Iss. 5

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

Mohamad, Mustafa, Rappaport, David, Toussaint, Godfried
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
31
Language:
english
Journal:
Graphs and Combinatorics
DOI:
10.1007/s00373-014-1467-4
Date:
September, 2015
File:
PDF, 281 KB
english, 2015
Conversion to is in progress
Conversion to is failed