Algorithms for Sequence Similarity Measures
Given two sets of points $A$ and $B$ ($|A| = m$, $|B| = n$), we seek to find a minimum-weight many-to-many matching which seeks to match each point in $A$ to at least one point in $B$ and vice versa. Each matched pair (an edge) has a weight. The goal is to find the matching that minimizes the tota...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en en |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1974/6202 |