Contact prediction is hardest for the most informative contacts, but improves with the incorporation of contact potentials

Jack Holland; Qinxin Pan; Gevorg Grigoryan

doi:10.1371/journal.pone.0199585

Loading metrics

Open Access

Peer-reviewed

Research Article

Contact prediction is hardest for the most informative contacts, but improves with the incorporation of contact potentials

Jack Holland,

Roles Methodology, Software, Validation, Visualization, Writing – original draft, Writing – review & editing

Affiliation Department of Computer Science, Dartmouth College, Hanover, NH 03755, United States of America

http://orcid.org/0000-0001-6682-0659

⨯
Qinxin Pan,

Roles Data curation, Methodology, Software, Visualization, Writing – original draft

Affiliation Department of Computer Science, Dartmouth College, Hanover, NH 03755, United States of America
⨯
Gevorg Grigoryan

Roles Conceptualization, Funding acquisition, Methodology, Project administration, Supervision, Writing – original draft, Writing – review & editing

* E-mail: gevorg.grigoryan@dartmouth.edu

Affiliations Department of Computer Science, Dartmouth College, Hanover, NH 03755, United States of America, Department of Biological Sciences, Dartmouth College, Hanover, NH 03755, United States of America
⨯

Contact prediction is hardest for the most informative contacts, but improves with the incorporation of contact potentials

Jack Holland,
Qinxin Pan,
Gevorg Grigoryan

Published: June 28, 2018
https://doi.org/10.1371/journal.pone.0199585

About the Authors

Jack Holland

Roles Methodology, Software, Validation, Visualization, Writing – original draft, Writing – review & editing

Affiliation Department of Computer Science, Dartmouth College, Hanover, NH 03755, United States of America

http://orcid.org/0000-0001-6682-0659

Qinxin Pan

Roles Data curation, Methodology, Software, Visualization, Writing – original draft

Affiliation Department of Computer Science, Dartmouth College, Hanover, NH 03755, United States of America

Gevorg Grigoryan

Roles Conceptualization, Funding acquisition, Methodology, Project administration, Supervision, Writing – original draft, Writing – review & editing

* E-mail: gevorg.grigoryan@dartmouth.edu

Affiliations Department of Computer Science, Dartmouth College, Hanover, NH 03755, United States of America, Department of Biological Sciences, Dartmouth College, Hanover, NH 03755, United States of America

Competing Interests

The authors have declared that no competing interests exist.

Subject Areas
?

For more information about PLOS Subject Areas, click here.
We want your feedback. Do these Subject Areas make sense for this article? Click the target next to the incorrect Subject Area and let us know. Thanks for your help!

Protein structure prediction
Is the Subject Area "Protein structure prediction" applicable to this article?

Thanks for your feedback.
Protein structure
Is the Subject Area "Protein structure" applicable to this article?

Thanks for your feedback.
Protein structure comparison
Is the Subject Area "Protein structure comparison" applicable to this article?

Thanks for your feedback.
Multiple alignment calculation
Is the Subject Area "Multiple alignment calculation" applicable to this article?

Thanks for your feedback.
Sequence alignment
Is the Subject Area "Sequence alignment" applicable to this article?

Thanks for your feedback.
Forecasting
Is the Subject Area "Forecasting" applicable to this article?

Thanks for your feedback.
Neural networks
Is the Subject Area "Neural networks" applicable to this article?

Thanks for your feedback.
Structural proteins
Is the Subject Area "Structural proteins" applicable to this article?

Thanks for your feedback.