Article

Free access

On the approximation of protein threading

Authors:

Tatsuya Akutsu,

Satoru MiyanoAuthors Info & Claims

RECOMB '97: Proceedings of the first annual international conference on Computational molecular biology

Pages 3 - 8

https://doi.org/10.1145/267521.267523

Published: 19 January 1997 Publication History

PDF eReader

References

[1]

S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, "Proof verification and hardness of approximation algorithms," Proc. ¿rd IEEE $yrnp. Foundations of Computer Science, pp. 14-23, 1992.

Google Scholar

[2]

J. U. Bowie, R. Lfithy and D. Eisenbetg, "A method to identify protein sequences that fold into a known threedimensional structures," Science, Vol. 253, pp. 164-170, 1991.

Crossref

Google Scholar

[3]

C. Branden and J. Tooze, Introduction to Protein Structure, Garland Publishing, 1991.

Google Scholar

[4]

S. H. Bryant and C. E. Lawrence, "An empirical energy function for threading protein sequence through the folding motif," PROTEINS: Structure, Function, and Genetics, Vol. 16, pp. 92-112, 1993.

Crossref

Google Scholar

[5]

C. Chothia, "One thousand families for the molecular biologist," Nature, Vol. 357, pp. 543-544, 1992.

Crossref

Google Scholar

[6]

A. Godzik and J. Skolnick, "Sequence-structure matching in globular proteins: apphcation to supersecondary and tertiary structure determination," Proc. National Academy of Science USA, Vol. 89, pp. 12098-12102, 1992.

Crossref

Google Scholar

[7]

W. E. Hart and S. Istrail, "Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal," Proc. 7th A CM Syrup. Theory o.f Computing, pp. 157-168, 1995.

Digital Library

Google Scholar

[8]

G. Kortsarz and D. Peleg, "On choosing a dense subgraph," Proc. 3jth IEEE Syrup. Foundations of Computer Science, pp. 692-701, 1993.

Google Scholar

[9]

R. H. Lathrop, "The protein threading problem with sequence amino acid interaction preferences is NP- complete," Protein Engineering, Vol. 7, pp. 1059-1068, 1994.

Crossref

Google Scholar

[10]

R. H. Lathrop and T. F. Smith, "A branch-and-bound algorithm for optimal protein threading with pairwise (contact potential) amino acid interactions," Proc. ~Tth Annual Hawaii International Conference on System Sciences, Vol. 5, pp. 365-374, 1994.

Google Scholar

[11]

D. Maier, "The complexity of some problems on subsequences and supersequences," J. A CM, Vol. 25, pp. 322-336, 1978.

Digital Library

Google Scholar

[12]

T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms, Elsevier Science, 1988.

Google Scholar

[13]

C. H. Papadimitriou and M. Yannakakis, "Optimization, approximation, and complexity classes," J. Computer and System Sciences, Vol. 43, pp. 425-440, 1991.

Crossref

Google Scholar

[14]

H. Tashimo and T. Akutsu, "Learning score function for protein threading using linear programming," Technical Report (in Japanese), MPS-8-4, information Processing Society of Japan, 1996.

Google Scholar

Cited By

View all

Akutsu TYagiura M(2006)On the complexity of deriving score functions from examples for problems in molecular biologyAutomata, Languages and Programming10.1007/BFb0055106(832-843)Online publication date: 26-May-2006
https://doi.org/10.1007/BFb0055106
Backofen RGilbert D(2001)Bioinformatics and ConstraintsConstraints10.1023/A:10114774209266:2/3(141-156)Online publication date: 1-Jun-2001
https://dl.acm.org/doi/10.1023/A%3A1011477420926
Goldman DPapadimitriou CIstrail S(1999)Algorithmic Aspects of Protein Structure SimilarityProceedings of the 40th Annual Symposium on Foundations of Computer Science10.5555/795665.796527Online publication date: 17-Oct-1999
https://dl.acm.org/doi/10.5555/795665.796527
Show More Cited By

Index Terms

On the approximation of protein threading

Recommendations

Low-homology protein threading

Motivation: The challenge of template-based modeling lies in the recognition of correct templates and generation of accurate sequence-template alignments. Homologous information has proved to be very powerful in detecting remote homologs, as demonstrated ...
Specificity and affinity quantification of protein–protein interactions

Motivation: Most biological processes are mediated by the protein–protein interactions. Determination of the protein–protein structures and insight into their interactions are vital to understand the mechanisms of protein functions. Currently, ...
Protein threading with residue-environment matching by artificial neural networks
SAC '04: Proceedings of the 2004 ACM symposium on Applied computing

Protein threading programs align a probe amino acid sequence onto a library of representative folds of known protein structure to identify a structural homology. A scoring function is usually formulated in terms of the threading energy to evaluate ...

Comments

Information & Contributors

Information

Published In

RECOMB '97: Proceedings of the first annual international conference on Computational molecular biology

January 1997

354 pages

ISBN:0897918827

DOI:10.1145/267521

Chairman:
Michael Waterman
Univ. of Southern California, Los Angeles

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 January 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

RECOMB97

Sponsor:

DOE
SIGACT

RECOMB97: The First Annual Conference on Research in Computational Molecular Biology

January 20 - 23, 1997

New Mexico, Santa Fe, USA

Acceptance Rates

RECOMB '97 Paper Acceptance Rate 43 of 117 submissions, 37%;

Overall Acceptance Rate 148 of 538 submissions, 28%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
344
Total Downloads

Downloads (Last 12 months)32
Downloads (Last 6 weeks)3

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Akutsu TYagiura M(2006)On the complexity of deriving score functions from examples for problems in molecular biologyAutomata, Languages and Programming10.1007/BFb0055106(832-843)Online publication date: 26-May-2006
https://doi.org/10.1007/BFb0055106
Backofen RGilbert D(2001)Bioinformatics and ConstraintsConstraints10.1023/A:10114774209266:2/3(141-156)Online publication date: 1-Jun-2001
https://dl.acm.org/doi/10.1023/A%3A1011477420926
Goldman DPapadimitriou CIstrail S(1999)Algorithmic Aspects of Protein Structure SimilarityProceedings of the 40th Annual Symposium on Foundations of Computer Science10.5555/795665.796527Online publication date: 17-Oct-1999
https://dl.acm.org/doi/10.5555/795665.796527
Lathrop RIstrail SPevzner PWaterman M(1999)An anytime algorithm for gapped block protein threading with pair interactionsProceedings of the third annual international conference on Computational molecular biology10.1145/299432.299488(238-249)Online publication date: 1-Apr-1999
https://dl.acm.org/doi/10.1145/299432.299488
Goldman DIstrail SPapadimitriou C(1999)Algorithmic aspects of protein structure similarity40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)10.1109/SFFCS.1999.814624(512-521)Online publication date: 1999
https://doi.org/10.1109/SFFCS.1999.814624
Berger BLeighton T(1998)Protein folding in the hydrophobic-hydrophilic (HP) is NP-completeProceedings of the second annual international conference on Computational molecular biology10.1145/279069.279080(30-39)Online publication date: 1-Mar-1998
https://dl.acm.org/doi/10.1145/279069.279080

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Low-homology protein threading

Specificity and affinity quantification of protein–protein interactions

Protein threading with residue-environment matching by artificial neural networks

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Low-homology protein threading

Specificity and affinity quantification of protein–protein interactions

Protein threading with residue-environment matching by artificial neural networks

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations