Dartmouth College Computer Science
Technical Report series
TR search TR listserv
|By author:||A B C D E F G H I J K L M N O P Q R S T U V W X Y Z|
|By number:||2020, 2019, 2018, 2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998, 1997, 1996, 1995, 1994, 1993, 1992, 1991, 1990, 1989, 1988, 1987, 1986|
In order to most effectively investigate protein structure and improve protein function, it is
necessary to carefully plan appropriate experiments. The combinatorial number of possible
experiment plans demands effective criteria and efficient algorithms to choose the one that
is in some sense optimal. This thesis addresses experiment planning challenges in two
significant applications. The first part of this thesis develops an integrated computational-experimental
approach for rapid discrimination of predicted protein structure models by
quantifying their consistency with relatively cheap and easy experiments (cross-linking
and site-directed mutagenesis followed by stability measurement). In order to obtain the
most information from noisy and sparse experimental data, rigorous Bayesian frameworks
have been developed to analyze the information content. Efficient algorithms have been
developed to choose the most informative, least expensive, and most robust experiments.
The effectiveness of this approach has been demonstrated using existing experimental data
as well as simulations, and it has been applied to discriminate predicted structure models
of the pTfa chaperone protein from bacteriophage lambda.
The second part of this thesis seeks to choose optimal breakpoint locations for protein engineering by site-directed recombination. In order to increase the possibility of obtaining folded and functional hybrids in protein recombination, it is necessary to retain the evolutionary relationships among amino acids that determine protein stability and functionality. A probabilistic hypergraph model has been developed to model these relationships, with edge weights representing their statistical significance derived from database and a protein family. The effectiveness of this model has been validated by showing its ability to distinguish functional hybrids from non-functional ones in existing experimental data. It has been proved to be NP-hard in general to choose the optimal breakpoint locations for recombination that minimize the total perturbation to these relationships, but exact and approximate algorithms have been developed for a number of important cases.
Ph.D thesis; Advisor Chris Bailey-Kellogg.
Bibliographic citation for this report: [plain text] [BIB] [BibTeX] [Refer]
Or copy and paste:
Xiaoduan Ye, "Experiment Planning for Protein Structure Elucidation and Site-Directed Protein Recombination." Dartmouth Computer Science Technical Report TR2008-614, May 2007.
Notify me about new tech reports.
Search the technical reports.
To receive paper copy of a report, by mail, send your address and the TR number to reports AT cs.dartmouth.edu
Copyright notice: The documents contained in this server are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
Technical reports collection maintained by David Kotz.