東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Convex Optimization Approaches for N...

Simoes Bravo Ferreira, Jose Frederico.

FindBook

Google Book

Amazon

博客來

Convex Optimization Approaches for NMR Assignment.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Convex Optimization Approaches for NMR Assignment./
作者:	Simoes Bravo Ferreira, Jose Frederico.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2018,
面頁冊數:	114 p.
附註:	Source: Dissertations Abstracts International, Volume: 80-06, Section: B.
Contained By:	Dissertations Abstracts International80-06B.
標題:	Applied Mathematics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10974411
ISBN:	9780438737747

Convex Optimization Approaches for NMR Assignment.
Simoes Bravo Ferreira, Jose Frederico.

Convex Optimization Approaches for NMR Assignment. - Ann Arbor : ProQuest Dissertations & Theses, 2018 - 114 p.

Source: Dissertations Abstracts International, Volume: 80-06, Section: B.

Thesis (Ph.D.)--Princeton University, 2018.

This item must not be sold to any third party vendors.

Nuclear Magnetic Resonance Spectroscopy (NMR) is the primary tool for structural determination of proteins in solution. It distinguishes itself from other such tools by uncovering geometric constraints at the atomic level, which are utilized in a maximal constraint satisfaction problem to produce accurate structures without requiring crystallization. Despite its widespread use, full automation of the NMR pipeline has not yet been achieved. Chief among the problematic steps in NMR spectroscopy is the problem of backbone assignment, which can be understood as a labeling step in which atoms are tagged with their resonance frequencies. This labeling is crucial for the construction of structural constraints, and consequently, for the determination of accurate structures. In this thesis, we describe convex optimization approaches to tackle the combinatorial problem of NMR backbone assignment. These approaches differ from mainstream solutions by seeking to find a single, maximum-likelihood solution via global optimization, rather than attempting to solve non-convex problems through heuristics. Chapter 2 introduces the first such approach, C-SDP, which is, at its core, a semidefinite programming relaxation to the Quadratic Assignment Problem (QAP) with PSD variables of dimension O(n) x O(n). An efficient distributed ADMM algorithm is described for solving the relaxation to optimality, producing strong lower bounds on several large QAP and TSP problems, and recovering optimal (near rank 1) solutions on NMR datasets. Chapter 3 describes a better scaling, linear programming approach to tackle NMR assignment on both spin system and peak list datasets. The resulting assignment pipeline is successfully applied to both simulated and experimental datasets, with state-of-the-art results on both.

ISBN: 9780438737747Subjects--Topical Terms:

1669109
Applied Mathematics.

Convex Optimization Approaches for NMR Assignment.
LDR:02832nmm a2200313 4500 001 2207984
005 20190929184023.5
008 201008s2018 ||||||||||||||||| ||eng d
020 $a 9780438737747
035 $a (MiAaPQ)AAI10974411
035 $a (MiAaPQ)princeton:12793
035 $a AAI10974411
040 $a MiAaPQ $c MiAaPQ
100 1 $a Simoes Bravo Ferreira, Jose Frederico. $3 3434986
245 1 0 $a Convex Optimization Approaches for NMR Assignment.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2018
300 $a 114 p.
500 $a Source: Dissertations Abstracts International, Volume: 80-06, Section: B.
500 $a Publisher info.: Dissertation/Thesis.
500 $a Advisor: Singer, Amit.
502 $a Thesis (Ph.D.)--Princeton University, 2018.
506 $a This item must not be sold to any third party vendors.
520 $a Nuclear Magnetic Resonance Spectroscopy (NMR) is the primary tool for structural determination of proteins in solution. It distinguishes itself from other such tools by uncovering geometric constraints at the atomic level, which are utilized in a maximal constraint satisfaction problem to produce accurate structures without requiring crystallization. Despite its widespread use, full automation of the NMR pipeline has not yet been achieved. Chief among the problematic steps in NMR spectroscopy is the problem of backbone assignment, which can be understood as a labeling step in which atoms are tagged with their resonance frequencies. This labeling is crucial for the construction of structural constraints, and consequently, for the determination of accurate structures. In this thesis, we describe convex optimization approaches to tackle the combinatorial problem of NMR backbone assignment. These approaches differ from mainstream solutions by seeking to find a single, maximum-likelihood solution via global optimization, rather than attempting to solve non-convex problems through heuristics. Chapter 2 introduces the first such approach, C-SDP, which is, at its core, a semidefinite programming relaxation to the Quadratic Assignment Problem (QAP) with PSD variables of dimension O(n) x O(n). An efficient distributed ADMM algorithm is described for solving the relaxation to optimality, producing strong lower bounds on several large QAP and TSP problems, and recovering optimal (near rank 1) solutions on NMR datasets. Chapter 3 describes a better scaling, linear programming approach to tackle NMR assignment on both spin system and peak list datasets. The resulting assignment pipeline is successfully applied to both simulated and experimental datasets, with state-of-the-art results on both.
590 $a School code: 0181.
650 4 $a Applied Mathematics. $3 1669109
690 $a 0364
710 2 $a Princeton University. $b Applied and Computational Mathematics. $3 3182352
773 0 $t Dissertations Abstracts International $g 80-06B.
790 $a 0181
791 $a Ph.D.
792 $a 2018
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10974411