Antibodies that bind to protein surfaces of interest can be used to report the three-dimensional structure of the protein as follows: Proteins are composed of linear polypeptide chains that fold together in complex spatial patterns to create the native protein structure. These folded structures form binding sites for antibodies. Antibody binding sites are typically "assembled" on the protein surface from segments that are far apart in the primary amino acid sequence of the target proteins. Short amino acid probe sequences that bind to the active region of each antibody can be used as witnesses to the antibody epitope surface and these probes can be efficiently selected from random sequence peptide libraries. This paper presents a new method to align these antibody epitopes to discontinuous regions of the one-dimensional amino acid sequence of a target protein. Such alignments of the epitopes indicate how segments of the protein sequence must be folded together in space and thus provide long-range constraints for solving the 3-D protein structure. This new antibody-based approach is applicable to the large fraction of proteins that are refractory to current approaches for structure determination and has the additional advantage of requiring very small amounts of the target protein. The binding site of an antibody is a surface, not just a continuous linear sequence, so the epitope mapping alignment problem is outside the scope of classical string alignment algorithms, such as Smith-Waterman. We formalize the alignment problem that is at the heart of this new approach, prove that the epitope mapping alignment problem is NP-complete, and give some initial results using a branch-and-bound algorithm to map two real-life cases. Initial results for two validation cases are presented for a graph-based protein surface neighbor mapping procedure that promises to provide additional spatial proximity information for the amino acid residues on the protein surface.
10 August 2018 in Biomechanics and Modeling in Mechanobiology
Osteoarthritis is a debilitating disease likely involving altered metabolism of the chondrocytes in articular cartilage. Chondrocytes can respond metabolically to mechanical loads via cellular mechanotransduction, and metabolic changes are significant because they produce the precursors to the tissue matrix necessary for cartilage health. However, a comprehensive understanding of how energy metabolism changes with loading remains elusive. To improve our understanding of chondrocyte mechanotransduction, we developed a computational model to calculate the rate of reactions (i.e. flux) across multiple components of central energy metabolism based on experimental data. We calculated average reaction flux profiles of central metabolism for SW1353 human chondrocytes subjected to dynamic compression for 30 minutes. The profiles were obtained solving a bounded variable linear least squares problem, representing the stoichiometry of human central energy metabolism. Compression synchronized chondrocyte energy metabolism. These data are consistent with dynamic compression inducing early time changes in central energy metabolism geared towards more active protein synthesis. Furthermore, this analysis demonstrates the utility of combining targeted metabolomic data with a computational model to enable rapid analysis of cellular energy utilization.
MIMO links can significantly improve network throughput by supporting multiple concurrent data streams between a pair of nodes and suppressing wireless interference. In this paper, we formally define a new cross-layer optimization problem for MIMO-based multihop wireless networks, which is referred to as the joint stream control and scheduling problem (SCSP). We first present a constant factor approximation algorithm to solve the SCSP. In addition, we present a heuristic algorithm to improve the performance further, which is shown to be efficient in practice by our numerical results.