The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
An ant colony optimisation algorithm for the 2D and 3D hydrophobic polar protein folding problem
Open accessAbstract
Background: The protein folding problem is a fundamental problems in computational molecular biology and biochemical physics. Various optimisation methods have been applied to formulations of the ab-initio folding problem that are based on reduced models of protein structure, including Monte Carlo methods, Evolutionary Algorithms, Tabu Search and hybrid approaches. In our work, we have introduced an ant colony optimisation (ACO) algorithm to address the non-deterministic polynomial-time hard (NP-hard) combinatorial problem of predicting a protein's conformation from its amino acid sequence under a widely studied, conceptually simple model – the 2-dimensional (2D) and 3-dimensional (3D) hydrophobic-polar (HP) model. Results: We present an improvement of our previous ACO algorithm for the 2D HP model and its extension to the 3D HP model. We show that this new algorithm, dubbed ACO-HPPFP-3, performs better than previous state-of-the-art algorithms on sequences whose native conformations do not contain structural nuclei (parts of the native fold that predominantly consist of local interactions) at the ends, but rather in the middle of the sequence, and that it generally finds a more diverse set of native conformations. Conclusions: The application of ACO to this bioinformatics problem compares favourably with specialised, state-of-the-art methods for the 2D and 3D HP protein folding problem; our empirical results indicate that our rather simple ACO algorithm scales worse with sequence length but usually finds a more diverse ensemble of native states. Therefore the development of ACO algorithms for more complex and realistic models of protein structure holds significant promise.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ant system: optimization by a colony of cooperating agents
Dorigo, M., Maniezzo, V., & Colorni, A. (1996) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.484436 · Cited by 12,067
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
Nonphysical sampling distributions in Monte Carlo free-energy estimation: Umbrella sampling
Torrie, G. M., & Valleau, J. P. (1977) · Journal of Computational Physics · doi:10.1016/0021-9991(77)90121-8 · Cited by 6,091
Ant Algorithms for Discrete Optimization
Dorigo, M., Caro, G. D., & Gambardella, L. M. (1999) · Artificial Life · doi:10.1162/106454699568728 · Cited by 2,808
Hoos (2000) · doi:10.1016/s0167-739x(00)00043-1 · Cited by 2,737
AREAS, VOLUMES, PACKING, AND PROTEIN STRUCTURE
Richards, F. M. (1977) · Annual Review of Biophysics and Bioengineering · doi:10.1146/annurev.bb.06.060177.001055 · Cited by 2,661
RASMOL: biomolecular graphics for all
Sayle, R. (1995) · Trends in Biochemical Sciences · doi:10.1016/s0968-0004(00)89080-5 · Cited by 2,575
Corne, D., Dorigo, M., Glover, F., Dasgupta, D., Moscato, P., Poli, R., & Price, K. V. (1999) · Cited by 2,136
Creighton, T. E. (1992) · Cited by 1,583
Multicanonical ensemble: A new approach to simulate first-order phase transitions
Berg, B. A., & Neuhaus, T. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.9 · Cited by 1,581
Cited by
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
Dorigo, M., Birattari, M., & Stutzle, T. (2006) · IEEE Computational Intelligence Magazine · doi:10.1109/ci-m.2006.248054 · Cited by 1,880
Ant colony optimization: Introduction and recent trends
Blum, C. (2005) · Physics of Life Reviews · doi:10.1016/j.plrev.2005.10.001 · Cited by 1,308
Coarse-Grained Protein Models and Their Applications
Kmiecik, S., Gront, D., Kolinski, M., Wieteska, L., Dawid, A. E., & Kolinski, A. (2016) · Chemical Reviews · doi:10.1021/acs.chemrev.6b00163 · Cited by 1,071
Ant Colony Optimization: Overview and Recent Advances
Dorigo, M., & Stützle, T. (2019) · International Series in Operations Research & Management Science · doi:10.1007/978-3-319-91086-4_10 · Cited by 722
Metadata
- Authors
- Shmygelska, A., & Hoos, H. H.
- Venue
- BMC Bioinformatics
- Published
- 2005-02-14
- Volume
- 6
- Issue
- 1
- Pages
- 30-30
- ISSN
- 1471-2105 (ISSN-L)
- OpenAlex
- W1640378004
- Cited by
- 260
- References
- 32
- FWCI
- 4.72
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An ant colony optimisation algorithm for the 2D and 3D hydrophobic polar protein folding problem. https://app.cochat.ai/papers/10.1186/1471-2105-6-30
- The paper
- Shmygelska, A., & Hoos, H. H. (2005). An ant colony optimisation algorithm for the 2D and 3D hydrophobic polar protein folding problem. BMC Bioinformatics. https://doi.org/10.1186/1471-2105-6-30
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.