Towards an efficient compression of 3D coordinates of macromolecular structures

The size and complexity of 3D macromolecular structures available in the Protein Data Bank is constantly growing. Current tools and file formats have reached limits of scalability. New compression approaches are required to support the visualization of large molecular complexes and enable new and sc...

Full description

Saved in:
Bibliographic Details
Published inPloS one Vol. 12; no. 3; p. e0174846
Main Authors Valasatava, Yana, Bradley, Anthony R, Rose, Alexander S, Duarte, Jose M, Prlić, Andreas, Rose, Peter W
Format Journal Article
LanguageEnglish
Published United States Public Library of Science 31.03.2017
Public Library of Science (PLoS)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:The size and complexity of 3D macromolecular structures available in the Protein Data Bank is constantly growing. Current tools and file formats have reached limits of scalability. New compression approaches are required to support the visualization of large molecular complexes and enable new and scalable means for data analysis. We evaluated a series of compression techniques for coordinates of 3D macromolecular structures and identified the best performing approaches. By balancing compression efficiency in terms of the decompression speed and compression ratio, and code complexity, our results provide the foundation for a novel standard to represent macromolecular coordinates in a compact and useful file format.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
Conceptualization: YV PWR.Formal analysis: YV PWR.Funding acquisition: PWR.Investigation: YV PWR.Methodology: YV PWR.Project administration: PWR.Resources: ARB ASR PWR.Software: YV PWR.Supervision: PWR.Validation: YV ARB ASR JMD AP PWR.Visualization: YV PWR.Writing – original draft: YV.Writing – review & editing: YV ARB ASR JMD AP PWR.
Competing Interests: The authors have declared that no competing interests exist.
ISSN:1932-6203
1932-6203
DOI:10.1371/journal.pone.0174846