## Algorithms for Sequence Similarity Measures

dc.contributor.author | Mohamad, Mustafa Amid | en |

dc.date | 2010-11-08 20:48:18.968 | |

dc.date.accessioned | 2010-11-17T17:16:20Z | |

dc.date.available | 2010-11-17T17:16:20Z | |

dc.date.issued | 2010-11-17T17:16:20Z | |

dc.identifier.uri | http://hdl.handle.net/1974/6202 | |

dc.description | Thesis (Master, Computing) -- Queen's University, 2010-11-08 20:48:18.968 | en |

dc.description.abstract | 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 total weight. We study two kinds of problems depending on the edge weight used. The first edge weight is the Euclidean distance, $d_1$. The second is edge weight is the square of the Euclidean distance, $d_2$. There already exists an $O(k\log k)$ algorithm for $d_1$, where $k=m+n$. We provide an $O(mn)$ algorithm for the $d_2$ problem. We also solve the problem of finding the minimum-weight matching when the sets $A$ and $B$ are allowed to be translated on the real line. We present an $O(mnk \log k)$ algorithm for the $d_1$ problem and an $O(3^{mn})$ algorithm for the $d_2$. Furthermore, we also deal with the special case where $A$ and $B$ lie on a circle of a specific circumference. We present an $O(k^2 \log k)$ algorithm and $O(kmn)$ algorithm for solving the minimum-weight matching for the $d_1$, and $d_2$ weights respectively. Much like the problem on the real line, we extend this problem to allow the sets $A$ and $B$ to be rotated on the circle. We try to find the minimum-weight many-to-many matching when rotations are allowed. For $d_1$ we present an $O(k^2mn \log k)$ algorithm and a $O(3^{mn})$ algorithm for $d_2$. | en |

dc.language.iso | eng | en |

dc.relation.ispartofseries | Canadian theses | en |

dc.rights | This publication is made available by the authority of the copyright owner solely for the purpose of private study and research and may not be copied or reproduced except as permitted by the copyright laws without written authority from the copyright owner. | en |

dc.subject | Many-to-Many Matching | en |

dc.subject | Algorithm | en |

dc.subject | Matching | en |

dc.subject | Minimum Cost | en |

dc.subject | Circle | en |

dc.subject | Line | en |

dc.subject | Translation | en |

dc.subject | Rotation | en |

dc.subject | Sequence Alignment | en |

dc.title | Algorithms for Sequence Similarity Measures | en |

dc.type | thesis | en |

dc.description.degree | M.Sc. | en |

dc.contributor.supervisor | Rappaport, David | en |

dc.contributor.department | Computing | en |

dc.degree.grantor | Queen's University at Kingston | en |