Degree Type

Thesis

Date of Award

2006

Degree Name

Master of Science

Department

Computer Science

First Advisor

David Fernandez-Baca

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.

DOI

https://doi.org/10.31274/rtd-180813-11029

Publisher

Digital Repository @ Iowa State University, http://lib.dr.iastate.edu

Copyright Owner

Mukul Subodh Bansal

Language

en

Proquest ID

AAI1439884

File Format

application/pdf

File Size

51 pages

Share

COinS