Algorithms for minimum bipartite fill-in and the gene-duplication problem
Date
2006-01-01
Authors
Bansal, Mukul
Major Professor
Advisor
David Fernandez-Baca
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Altmetrics
Authors
Research Projects
Organizational Units
Organizational Unit
Journal Issue
Is Version Of
Versions
Series
Department
Computer Science
Abstract
This thesis deals with two different problems: (1) the minimum bipartite fill-in problem, and (2) the gene-duplication problem. We establish the fixed parameter tractability of the minimum bipartite fill-in problem and develop a faster local search algorithm which speeds up heuristics for the gene-duplication problem.
Comments
Description
Keywords
Citation
Source
Subject Categories
Keywords
Copyright
Sun Jan 01 00:00:00 UTC 2006