DOCSLIB.ORG

Protein Folding, De Novo Protein Design, and Peptide Identification in Proteomics

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Protein Folding, De Novo Protein Design, and Peptide Identification in Proteomics Protein Folding, De Novo Protein Design, and Peptide Identification in Proteomics Christodoulos A. Floudas Princeton University Department of Chemical Engineering Program of Applied and Computational Mathematics Department of Operations Research and Financial Engineering Center for Quantitative Biology REVOLUTION OF GENOMICS DNA RNA Nucleus Protein (genome) (transcriptome) (proteome) Protein - Protein Nucleic Acid - Protein Feedback Protein - Ligand Cell Design of Drugs and Inhibitors Metabolic Networks Phenotype Outline From Sequence to Structure • Structure Prediction in Protein Folding ASTRO-FOLD • Helix Prediction • Beta Sheet Topology & Disulfide Bridges • 3-D Structure Prediction From Structure to Function • De Novo Peptide Design • Sequence Selection • Fold Specificity • Design of Inhibitors for Complement 3 Peptide and Protein Identification via Tandem Mass Spectrometry Structure Prediction In Protein Folding: Outline • Introduction to Protein Structure Prediction • Free Energy Calculations in Oligo-peptides • Prediction of Helical Segments • Prediction of Beta Sheet Topologies • Prediction of Loop Structures • Derivation of Restraints • Prediction of Protein Tertiary Structure Structure Prediction In Protein Folding Review Aricles • Klepeis J.L., H.D. Schafroth, K.M. Westerberg, and C.A. Floudas, "Deterministic Global Optimization and Ab Initio Approaches for the Structure Prediction of Polypeptides, Dynamics of Protein Folding and Protein-Protein Interactions", Advances in Chemical Physics, 120, 265-457 (2002). • Floudas C.A., "Research Challenges, Opportunities and Synergism in Systems Engineering and Computational Biology", AIChE Journal, 51, 1872-1884 (2005). • Floudas C.A., H.K. Fung, S.R. McAllister, M. Monnigmann, and R. Rajgaria, "Advances in Protein Structure Prediction and De Novo Protein Design: A Review", Chemical Engineering Science, 61, 966-988 (2006). • C.A. Floudas, "Computational Methods in Protein Structure Prediction", Biotechnology and Bioengineering, 97, 207-213 (2007). Protein Primary Structure • Made up primarily of amino acids O Amino group C H2N Side chain CH OH C carbon R Carboxyl group • This “alphabet” is often represented by a one letter abbreviation PDB: 1q4sA MHRTSNGSHATGGNLPDVASHYPVAYEQTLDGTVGFVIDEMTPERATASVEVTDTLRQRWGLVHGGAYCALAEMLA TEATVAVVHEKGMMAVGQSNHTSFFRPVKEGHVRAEAVRIHAGSTTWFWDVSLRDDAGRLCAVSSMSIAVRPRRD Proteins: Sequence of Amino Acids • 20 letter alphabet • 3M known sequences • 200 amino acids/domain • 25K elucidated structures Protein Secondary Structure • Local structural motifs defined by hydrogen bonding patterns -helix -sheet Protein Dihedral Angles • Fixed bond length • Fixed bond angles • Dihedral angles as variable representation Image from Creighton, 1993 Why Protein Folding ? • Human Genome Project (Nature, Vol 409, 15 Feb 2001) • 3 x 109 base pairs 104 functional proteins • ~ 3.1 x 104 genes • Computational Structural Biology • Protein interactions Drug design • Role of mutations Protein Folding Challenges Structure Prediction Dynamics Can we predict the Can we elucidate the 3-D structure from mechanism of the only the 1-D amino folding process ? acid sequence ? How does the sequence of amino acids physically fold into the 3-D structure ? Protein Structure Prediction Amino acid sequence [PDB: 1q4sA ] MHRTSNGSHATGGNLPDVASHYPVAYEQTLDGTVGFVIDEMTPERATASVEVTDTLRQRWGLVHGGAYCALAEMLA TEATVAVVHEKGMMAVGQSNHTSFFRPVKEGHVRAEAVRIHAGSTTWFWDVSLRDDAGRLCAVSSMSIAVRPRRD Helical structure MHRTSNGSHATGGNLPDVASHYPVAYEQTLDGTVGFVIDEMTPERATASVEVTDTLRQRWGLVHGGAYCALAEMLA TEATVAVVHEKGMMAVGQSNHTSFFRPVKEGHVRAEAVRIHAGSTTWFWDVSLRDDAGRLCAVSSMSIAVRPRRD Beta strand and sheet structure MHRTSNGSHATGGNLPDVASHYPVAYEQTLDGTVGFVIDEMTPERATASVEVTDTLRQRWGLVHGGAYCALAEMLA TEATVAVVHEKGMMAVGQSNHTSFFRPVKEGHVRAEAVRIHAGSTTWFWDVSLRDDAGRLCAVSSMSIAVRPRRD 3D Protein Structure Protein Folding: Advances • Homology Modeling / Comparative Modeling – The probe and template sequences are evolutionary related – Honig et al.; Sali et al.; Fischer et al.; Rost et al; • Fold Recognition / Threading – For the query sequence, determine closest matching structure from a library of known folds by scoring function – Skolnick et al.; Jones et al.; Bryant et al.; Xu et al.; Elber et al.; – Baker et al.; Rychlewski & Ginalski; Honig et al. Protein Folding: Advances • First Principles with Database Information – Secondary and/or tertiary information from databases/statistical methods – Levitt et al.; Baker et al.; Skolnick, Kolinski et al.; Friesner et al. • First Principles without Database Information – Physiochemical models with most general application – Scheraga et al.; Rose et al.; Floudas et al. ASTRO-FOLD Klepeis, J.L and C.A. Floudas. Biophys J 85 (2003) 2119 Structure Prediction In Protein Folding: Outline • Introduction to Protein Structure Prediction • Free Energy Calculations in Oligo-peptides • Prediction of Helical Segments • Prediction of Beta Sheet Topologies • Prediction of Loop Structures • Derivation of Restraints • Prediction of Protein Tertiary Structure Free Energy Calculations in Oligopeptide Folding Relevant References: • Maranas C.D., I.P. Androulakis and C.A. Floudas, "A Deterministic Global Optimization Approach for the Protein Folding Problem", DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 133-150, (1995). • Androulakis I.P., C.D. Maranas and C.A. Floudas, "Prediction of Oligopeptide Conformations via Deterministic Global Optimization", Journal of Global Optimization, 11, pp. 1-34, June (1997). • Klepeis J.L. and C.A. Floudas, "A Comparative Study of Global Minimum Energy Conformations of Hydrated Peptides", Journal of Computational Chemistry, 20, pp.636-654, (1999). • Westerberg K.M. and C.A. Floudas, "Locating All Transition States and Studying Reaction Pathways of Potential Energy Surfaces", Journal of Chemical Physics, 110, pp.9259-9296, (1999). • Klepeis J.L. and C.A. Floudas, "Free Energy Calculations for Peptides via Deterministic Global Optimization", Journal of Chemical Physics, 110, pp.7491-7512, (1999). • Westerberg K.M. and C.A. Floudas, "Dynamics of Peptide Folding : Transition States and Reaction Pathways of Solvated and Unsolvated Tetra-Alanine", Journal of Global Optimization, 15, 261-297 (1999). Structure Prediction In Protein Folding: Outline • Introduction to Protein Structure Prediction • Free Energy Calculations in Oligo-peptides • Prediction of Helical Segments • Prediction of Beta Sheet Topologies • Prediction of Loop Structures • Derivation of Restraints • Prediction of Protein Tertiary Structure Prediction of Helical Segments from First Principles Relevant References: • Klepeis J.L. and C.A. Floudas, "Ab Initio Prediction of Helical Segments in Polypeptides", Journal of Computational Chemistry, 23, 245-266 (2002). • Subramani A. and C.A. Floudas, “A Novel Approach for the Prediction of Helices and Beta Strands”, in preparation (2008). ASTRO-FOLD Klepeis & Floudas, 2002c Understanding Helix Formation Physical Characteristics of Helices • Well defined backbones and hydrogen bonding patterns • Different types of helices • : hydrogen bonding every fourth residues (3.6) • 310 : backbone turn every three residues Physical Understanding of Protein Folding • Two competing explanations • Local forces : hierarchical folding • Non-local forces : hydrophobic collapse Experimental Evidence for Helix Formation • Helix formation proceeds rapidly • Sequence sufficient to identify initiation \ termination Helix formation dominated by local forces Helix Prediction : Key Ideas Klepeis & Floudas 2002a Overlapping oligopeptides Decompose polypeptide to identify local sites of helix formation and termination Ensemble of low energy states Calculate properties of proteins using data from many low energy states rather than a single state Free energy calculations Klepeis & Floudas 2000 Model proteins using detailed energy calculations including entropic and solvation contributions Deterministic global optimization Floudas 2000 Predict low energy states using powerful global optimization approaches such as aBB Overlapping Oligopeptides • Decompose polypeptide sequence into smaller oligopeptide sequences • Pentapeptides • Heptapeptides • Nonapeptides • Capture local interactions governing helix formation • Combine free energy calculations to get prediction Ensemble of Low Energy States Klepeis & Floudas 1999 Generate low energy states along with global minimum energy state Mathematical formulation • Nonconvex optimization problem • Requires global optimization search Free Energy Algorithm Klepeis & Floudas 1999 Free energy calculations require methods for finding low energy local minima BB based approaches capitalize on • ability to identify domains of low energy • information from lower bounding function L(x) • initialize and locally minimize lower bounding functions multiple times in each domain • unique lower bounding minima serve as initial points for minimizations of original E(x) Search Techniques BB Deterministic Global Optimization Floudas & coworkers 1994,1995,1996,1998,1999,2000 • based on branch-and-bound framework • convergence through successive subdivision at each level in the b&b tree to generate non-increasing upper bounds (original problem) and non-decreasing lower bounds (convexified problem) • guaranteed -convergence for C2 NLPs Conformational Space Annealing (CSA) Scheraga & coworkers 1997,1998 • stochastic prediction of global minimum energy state • genetic algorithm updates produce low energy states • anneal using deviation between energy states • termination
Load more

Recommended publications
  • Spacetime Singularities Vs. Topologies in the Zeeman-Göbel
    Spacetime Singularities vs. Topologies in the Zeeman-Gobel¨ Class Kyriakos Papadopoulos1, Basil K. Papadopoulos2 1. Department of Mathematics, Kuwait University, PO Box 5969, Safat 13060, Kuwait 2. Department of Civil Engineering, Democritus University of Thrace, Greece Abstract In this article we first observe that the Path topology of Hawking, King and Mac- Carthy is an analogue, in curved spacetimes, of a topology that was suggested by Zeeman as an alternative topology to his so-called Fine topology in Minkowski space- time. We then review a result of a recent paper on spaces of paths and the Path topology, and see that there are at least five more topologies in the class Z − G of Zeeman-G¨obel topologies which admit a countable basis, incorporate the causal and conformal structures, but the Limit Curve Theorem fails to hold. The ”problem” that arXiv:1712.03270v6 [math-ph] 18 Jun 2018 L.C.T. does not hold can be resolved by ”adding back” the light-cones in the basic-open sets of these topologies, and create new basic open sets for new topologies. But, the main question is: do we really need the L.C.T. to hold, and why? Why is the manifold topology, under which the group of homeomorphisms of a spacetime is vast and of no physical significance (Zeeman), more preferable from an appropriate topology in the class Z − G under which a homeomorphism is an isometry (G¨obel)? Since topological conditions that come as a result of a causality requirement are key in the existence of singularities in general relativity, the global topological conditions that one will supply the spacetime manifold might play an important role in describing the transition from the quantum non-local theory to a classical local theory.
    [Show full text]
  • Topology of Energy Surfaces and Existence of Transversal Poincaré Sections
    Topology of energy surfaces and existence of transversal Poincar´esections Alexey Bolsinova Holger R. Dullinb Andreas Wittekb a) Department of Mechanics and Mathematics Moscow State University Moscow 119899, Russia b) Institut f¨ur Theoretische Physik Universit¨at Bremen Postfach 330440 28344 Bremen, Germany Email: [email protected] February 1996 Abstract Two questions on the topology of compact energy surfaces of natural two degrees of freedom Hamiltonian systems in a magnetic field are discussed. We show that the topology of this 3-manifold (if it is not a unit tangent bundle) is uniquely determined by the Euler characteristic of the accessible region in arXiv:chao-dyn/9602023v1 29 Feb 1996 configuration space. In this class of 3-manifolds for most cases there does not exist a transverse and complete Poincar´esection. We show that there are topological obstacles for its existence such that only in the cases of S1 × S2 and T 3 such a Poincar´esection can exist. 1 Introduction The question of the topology of the energy surface of Hamiltonian systems was al- ready treated in the 20’s by Birkhoff and Hotelling [8, 9]. Birkhoff proposed the “streamline analogy” [3], i.e. the idea that the flow of a Hamiltonian system on the 3-manifold could be viewed as the streamlines of an incompressible fluid evolving in this manifold. Extending the work of Poincar´e[14] he noted that it might be difficult 1 to find a transverse Poincar´esection which is complete (i.e. for which every stream- line starting from the surface of section returns to it) [1].
    [Show full text]
  • Systems-Based Approaches at the Frontiers of Chemical Engineering and Computational Biology: Advances and Challenges
    Systems-Based Approaches at the Frontiers of Chemical Engineering and Computational Biology: Advances and Challenges Christodoulos A. Floudas Princeton University Department of Chemical Engineering Program of Applied and Computational Mathematics Department of Operations Research and Financial Engineering Center for Quantitative Biology Outline • Theme: Scientific/Personal Journey • Research Philosophy at CASL (Computer Aided Systems Laboratory, Princeton University) • Research Areas: Advances & Challenges • Acknowledgements Greece Ioannina, Greece Ioannina,Greece (Courtesy of G. Floudas) Thessaloniki, Greece Aristotle University of Thessaloniki Department of Chemical Engineering Aristotle University of Thessaloniki Undergraduate Studies(1977-1982) Pittsburgh, PA Carnegie Mellon University Graduate Studies How did it all start? • Ph.D. Thesis: Sept. 82 – Dec. 85 •Advisor: Ignacio E. Grossmann • Synthesis of Flexible Heat Exchanger Networks (82-85) • Uncertainty Analysis (82-85) Princeton, NJ Princeton University Computer Aided Systems Laboratory Interface Product & Process Systems Engineering • Chemical Engineering • Applied Mathematics Research • Operations Research Areas • Computer Science • Computational Chemistry Computational Biology & Genomics • Computational Biology Unified Theory • address fundamental problems and applications via mathematical and Research modeling of microscopic, mesoscopic and macroscopic level Philosophy • rigorous optimization theory and algorithms • large scale computations in high performance clusters Mathematical
    [Show full text]
  • The Structure and Interpretation of Cosmology
    The Structure and Interpretation of Cosmology Gordon McCabe December 3, 2003 Abstract The purpose of this paper is to review, clarify, and critically analyse modern mathematical cosmology. The emphasis is upon the mathemati- cal structures involved, rather than numerical computations. The opening section reviews and clarifies the Friedmann-Robertson-Walker models of General Relativistic Cosmology, while Section 2 deals with the spatially homogeneous models. Particular attention is paid to the topological and geometrical aspects of these models. Section 3 explains how the mathe- matical formalism can be linked with astronomical observation. Sections 4 and 5 provide a critical analysis of Inflationary Cosmology and Quan- tum Cosmology, with particular attention to the claims made that these theories can explain the creation of the universe. 1 The Friedmann-Robertson-Walker models Let us review and clarify the topological and geometrical aspects of the Friedmann-Robertson-Walker (FRW) models of General Relativistic Cosmol- ogy. Geometrically, a FRW model is a 4-dimensional Lorentzian manifold M which can be expressed as a warped product, (O’Neill [1], Chapter 12; Heller [2], Chapter 6): I £R Σ 1 I as an open interval of the pseudo-Euclidean manifold R1, and Σ is a com- plete and connected 3-dimensional Riemannian manifold. The warping function R is a smooth, real-valued, non-negative function upon the open interval I. It will otherwise be known as the scale factor. If we deonote by t the natural coordinate function upon I, and if we denote the metric tensor on Σ as γ, then the Lorentzian metric g on M can be written as g = ¡dt ­ dt + R(t)2γ One can consider the open interval I to be the time axis of the warped prod- uct cosmology.
    [Show full text]
  • G. Besson the GEOMETRIZATION CONJECTURE AFTER R
    Rend. Sem. Mat. Univ. Pol. Torino - Vol. 65, 4 (2007) G. Besson∗ THE GEOMETRIZATIONCONJECTURE AFTER R. HAMILTON AND G. PERELMAN 1. Introduction This is the text of a Lagrange Lecture given in the mathematics department of the University of Torino. It aims at describing quite briefly the main milestones in the proof of the Geometrization conjecture due to G. Perelman using R. Hamilton’s Ricci Flow. It is by no means exhaustive and intends to be a rough guide to the reading of the detailed literature on the subject. Extended notes have been published by H.-D. Cao and X.-P. Zhu ([5]), B. Kleiner and J. Lott ([16]) and J. Morgan and G. Tian ([17]). The reader may also look at the following survey papers [1, 3, 21] and the forthcoming monography [2]. 2. The classification of surfaces It is known since the end of the 19th century that any closed orientable surface is the boundary of a ”bretzel”. And to the question: how is the sphere characterized, among closed orientable surfaces? We can give a very simple answer. It is the only simply-connected surface. ∗“LEZIONELAGRANGIANA” given on January 30th, 2007. 397 398 G. Besson p This means that any continuous loop can be continuously deformed to a constant loop (to a point). 3. The 3-manifolds case We may ask the same question, that is, let M be a closed, connected and orientable 3- manifold. How can we distinguish the sphere? The answer is the content of the famous Poincar´e conjecture. CONJECTURE 1 (Poincar´e [22], 1904).
    [Show full text]
  • On the Omega Limit Sets for Analytic Flows
    KYUNGPOOK Math. J. 54(2014), 333-339 http://dx.doi.org/10.5666/KMJ.2014.54.2.333 On the Omega Limit Sets for Analytic Flows Jaeyoo Choy¤ Department of Mathematics, Kyungpook National University, Sankyuk-dong, Buk- gu, Daegu 702-701, Republic of Korea e-mail : [email protected] Hahng-Yun Chuy Department of Mathematics, Chungnam National University, 99 Daehak-ro, Yuseong- Gu, Daejeon 305-764, Republic of Korea e-mail : [email protected] Abstract. In this paper, we describe the characterizations of omega limit sets (= !-limit set) on R2 in detail. For a local real analytic flow © by z0 = f(z) on R2, we prove the !-limit set from the basin of a given attractor is in the boundary of the attractor. Using the result of Jim¶enez-L¶opez and Llibre [9], we can completely understand how both the attractors and the !-limit sets from the basin. 1. Introduction Attractors and !-limit sets, arising from their ubiquitous applications in Dy- namical Systems, have played an important role in the ¯eld with the useful proper- ties. Especially, these are used to describe the time behavior for dynamical systems, and to provide the dynamicists with certain notions for localizing the complexity. For a manifold M with a vector ¯eld on it, and a point q 2 M, we denote the inte- gral curve (with the initial point q) by Zq(t). Let an open interval (aq; bq), possibly with aq = ¡1 or bq = 1, be the maximal domain on which Zq(t) is de¯ned. Let us de¯ne the !-limit set of q by !(q) = fx 2 M : x = lim Zq(tn) for some sequence tn ! bq as n ! 1g: n!1 In the paper, we restrict our interest on R2.
    [Show full text]
  • Show That Each of the Following Is a Topological Space. (1) Let X Denote the Set {1, 2, 3}, and Declare the Open Sets to Be {1}, {2, 3}, {1, 2, 3}, and the Empty Set
    Chapter 2. Topological Spaces Example 1. [Exercise 2.2] Show that each of the following is a topological space. (1) Let X denote the set f1; 2; 3g, and declare the open sets to be f1g, f2; 3g, f1; 2; 3g, and the empty set. (2) Any set X whatsoever, with T = fall subsets of Xg. This is called the discrete topology on X, and (X; T ) is called a discrete space. (3) Any set X, with T = f;;Xg. This is called the trivial topology on X. (4) Any metric space (M; d), with T equal to the collection of all subsets of M that are open in the metric space sense. This topology is called the metric topology on M. We only check (4). It is clear that ; and M are in T . Let U1;:::;Un 2 T and let p 2 U1 \···\ Un. There exist open balls B1 ⊆ U1;:::;Bn ⊆ Un that contain p, so the intersection B1 \···\ Bn ⊆ U1 \···\ Un is an open ball containing p. This shows that U1 \···\ Un 2 T . Now let fUαg be some collection of elements in T which we can Sα2A assume to be nonempty. If p 2 Uα we can choose some α 2 A, and there exists an α2A S S open ball B ⊆ Uα containing p. But B ⊆ α2A Uα, so this shows that α2A Uα 2 T . Theorem 2. [Exercise 2.9] Let X be a topological space and let A ⊆ X be any subset. (1) A point q is in the interior of A if and only if q has a neighborhood contained in A.
    [Show full text]
  • 3 Hausdorff and Connected Spaces
    3 Hausdorff and Connected Spaces In this chapter we address the question of when two spaces are homeomorphic. This is done by examining two properties that are shared by any pair of homeo- morphic spaces. More importantly, if two spaces do not share the property they are not homeomorphic. Definition A space X is Hausdorff , 8x; y 2 X such that x 6= y; 9U; V open in X such that x 2 U; y 2 V and U \ V = ;. Example 3.1. Let X = fa; b; cg Take the list of topologies from Example 1.6 and decide which if any are Hausdorff. Justify your answers. Theorem 3.2. State and prove a theorem about finite Hausdorff spaces. Note that your proof should use the fact that your space is finite. Theorem 3.3. E is Hausdorff. Proof. Prove or disprove. Theorem 3.4. [0; 1] with the subspace from E is Hausdorff. Proof. Prove or disprove. Theorem 3.5.H 1 is Hausdorff. Proof. Prove or disprove. Theorem 3.6.F 1 is Hausdorff. Proof. Prove or disprove. Theorem 3.7.D 1 is Hausdorff. Proof. Prove or disprove. Theorem 3.8.T 1 is Hausdorff. Proof. Prove or disprove. Theorem 3.9. Any subspace of a Hausdorff space is Hausdorff. 1 Proof. Prove or disprove. Theorem 3.10. X ≈ Y ) (X Hausdorff , Y Hausdorff). Proof. Fill in proof. Remark 3.11. • State the converse of this theorem. Prove or disprove it. • State the contrapositive. Prove or disprove it. • Does this theorem help in classifying E; H1; F1; D1; and T1? Definition A space X is connected , X cannot be written as the union of two non-empty disjoint open sets.
    [Show full text]
  • On “Asymptotically Flat” Space–Times with G2–Invariant Cauchy Surfaces
    On “asymptotically flat” space–times with G2–invariant Cauchy surfaces B.K. Berger∗ P.T. Chru´sciel† V. Moncrief‡ Institute for Theoretical Physics University of California Santa Barbara, California 93106–4030 gr-qc/9404005 Abstract In this paper we study space-times which evolve out of Cauchy data (Σ, 3g, K) invariant under the action of a two-dimensional commutative Lie group. Moreover (Σ, 3g, K) are assumed to satisfy certain complete- ness and asymptotic flatness conditions in spacelike directions. We show that asymptotic flatness and energy conditions exclude all topologies and 3 group actions except for a cylindrically symmetric R , or a periodic iden- tification thereof along the z–axis. We prove that asymptotic flatness, en- ergy conditions and cylindrical symmetry exclude the existence of compact trapped surfaces. Finally we show that the recent results of Christodoulou and Tahvildar–Zadeh concerning global existence of a class of wave–maps imply that strong cosmic censorship holds in the class of asymptotically flat cylindrically symmetric electro–vacuum space–times. ∗Permanent address: Department of Physics, Oakland University, Rochester MI 48309. Supported in part by an NSF grant # PHY 89–04035 to the ITP, UCSB and NSF grants # PHY–9107162 and PHY–9305599 to Oakland University. e–mail: [email protected] †On leave from the Institute of Mathematics of the Polish Academy of Sciences. Supported in part by a KBN grant # 2 1047 9101, an NSF grant # PHY 89–04035 to the ITP, UCSB, and the Alexander von Humboldt Foundation. e–mail: [email protected]. Present address: Max Planck Institut f¨ur Astrophysik, Karl Schwarzschild Str.
    [Show full text]
  • Topology-Controlled Reconstruction of Multi-Labelled Domains from Cross-Sections
    Topology-controlled Reconstruction of Multi-labelled Domains from Cross-sections ZHIYANG HUANG, Washington University in St. Louis MING ZOU, Washington University in St. Louis NATHAN CARR, Adobe Systems TAO JU, Washington University in St. Louis Fig. 1. Given several multi-labeled planes depicting the anatomical regions of a mouse brain (a), reconstruction without topology control (b1) leads to redundant handles for the red and yellow labels (black arrows in c1, d1) and disconnection for the green label (e1). Our method (b2) allows the user to prescribe the topology such that the red label has one tunnel (gray arrow in c2), the yellow label has no tunnels (d2), and the green label is connected (e2). The legends in (b1,b2) report, for each label in the reconstruction, the genus of each surface component bounding that label (e.g., “0,0” means two surfaces each with genus 0). User-specified constraints are colored red. In this work we present the rst algorithm for reconstructing multi-labeled Additional Key Words and Phrases: surface reconstruction, material inter- material interfaces the allows for explicit topology control. Our algorithm faces, topology, contour interpolation takes in a set of 2D cross-sectional slices (not necessarily parallel), each ACM Reference format: partitioned by a curve network into labeled regions representing dierent Zhiyang Huang, Ming Zou, Nathan Carr, and Tao Ju. 2017. Topology-controlled material types. For each label, the user has the option to constrain the num- Reconstruction of Multi-labelled Domains from Cross-sections. ACM Trans. ber of connected components and genus. Our algorithm is able to not only Graph.
    [Show full text]
  • The Structure and Interpretation of Cosmology: Part I-General
    The Structure and Interpretation of Cosmology: Part I - General Relativistic Cosmology Gordon McCabe October 9, 2018 Abstract The purpose of this work is to review, clarify, and critically analyse modern mathematical cosmology. The emphasis is upon mathematical objects and structures, rather than numerical computations. This pa- per concentrates on general relativistic cosmology. The opening section reviews and clarifies the Friedmann-Robertson-Walker models of general relativistic cosmology, while Section 2 deals with the spatially homoge- neous models. Particular attention is paid in these opening sections to the topological and geometrical aspects of cosmological models. Section 3 explains how the mathematical formalism can be linked with astronom- ical observation. In particular, the informal, observational notion of the celestial sphere is given a rigorous mathematical implementation. Part II of this work will concentrate on inflationary cosmology and quantum cosmology. 1 The Friedmann-Robertson-Walker models 1.1 Geometry and topology arXiv:gr-qc/0503028v1 7 Mar 2005 Let us review and clarify the topological and geometrical aspects of the Friedmann-Robertson-Walker (FRW) models of general relativistic cosmology. Whilst doing so will contribute to the overall intention of this paper to clarify, by means of precise mathematical concepts, the notions of modern cosmology, there are further philosophical motivations: firstly, to emphasise the immense variety of possible topologies and geometries for our universe, consistent with empirical (i.e. astronomical) data; and secondly, to emphasise the great variety of possible other universes. The general interpretational doctrine adopted in this paper can be referred to as ‘structuralism’, in the sense advocated by Patrick Suppes (1969), Joseph Sneed (1971), Frederick Suppe (1989), and others.
    [Show full text]
  • [Exercise 2.2] Show That Each of the Following Is a Topological Space
    Chapter 2. Topological Spaces Example 1. [Exercise 2.2] Show that each of the following is a topological space. (1) Let X denote the set f1; 2; 3g, and declare the open sets to be f1g, f2; 3g, f1; 2; 3g, and the empty set. (2) Any set X whatsoever, with T = fall subsets of Xg. This is called the discrete topology on X, and (X; T ) is called a discrete space. (3) Any set X, with T = f;;Xg. This is called the trivial topology on X. (4) Any metric space (M; d), with T equal to the collection of all subsets of M that are open in the metric space sense. This topology is called the metric topology on M. We only check (4). It is clear that ; and M are in T . Let U1;:::;Un 2 T and let p 2 U1 \···\ Un. There exist open balls B1 ⊆ U1;:::;Bn ⊆ Un that contain p, so the intersection B1 \···\ Bn ⊆ U1 \···\ Un is an open ball containing p. This shows that U1 \···\ Un 2 T . Now let fUαg be some collection of elements in T which we can Sα2A assume to be nonempty. If p 2 Uα we can choose some α 2 A, and there exists an α2A S S open ball B ⊆ Uα containing p. But B ⊆ α2A Uα, so this shows that α2A Uα 2 T . Theorem 2. [Exercise 2.9] Let X be a topological space and let A ⊆ X be any subset. (1) A point q is in the interior of A if and only if q has a neighborhood contained in A.
    [Show full text]