The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
MM-align: a quick algorithm for aligning multiple-chain protein complex structures using iterative dynamic programming
Open accessAbstract
Structural comparison of multiple-chain protein complexes is essential in many studies of protein-protein interactions. We develop a new algorithm, MM-align, for sequence-independent alignment of protein complex structures. The algorithm is built on a heuristic iteration of a modified Needleman-Wunsch dynamic programming (DP) algorithm, with the alignment score specified by the inter-complex residue distances. The multiple chains in each complex are first joined, in every possible order, and then simultaneously aligned with cross-chain alignments prevented. The alignments of interface residues are enhanced by an interface-specific weighting factor. MM-align is tested on a large-scale benchmark set of 205 x 3897 non-homologous multiple-chain complex pairs. Compared with a naïve extension of the monomer alignment program of TM-align, the alignment accuracy of MM-align is significantly higher as judged by the average TM-score of the physically-aligned residues. MM-align is about two times faster than TM-align because of omitting the cross-alignment zone of the DP matrix. It also shows that the enhanced alignment of the interfaces helps in identifying biologically relevant protein complex pairs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Needleman, S. B., & Wunsch, C. D. (1970) · Journal of Molecular Biology · doi:10.1016/0022-2836(70)90057-4 · Cited by 11,288
Anatomy of hot spots in protein interfaces
Bogan, A. A., & Thorn, K. S. (1998) · Journal of Molecular Biology · doi:10.1006/jmbi.1998.1843 · Cited by 1,988
The impact of translocations and gene fusions on cancer causation
Mitelman, F., Johansson, B., & Mertens, F. (2007) · Nature Reviews Cancer · doi:10.1038/nrc2091 · Cited by 1,400
CAPRI: A Critical Assessment of PRedicted Interactions
Janin, J., Henrick, K., Moult, J., Eyck, L. T., Sternberg, M. J. E., Vajda, S., Vakser, I., & Wodak, S. J. (2003) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.10381 · Cited by 703
Protein structure prediction: when is it useful?
Zhang, Y. (2009) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2009.02.005 · Cited by 277
Self-citation
Cited by
Utilizing sequence intrinsic composition to classify protein-coding and long non-coding transcripts
Sun, L., Luo, H., Bu, D., Zhao, G., Yu, K., Zhang, C., Liu, Y., Chen, R., & Zhao, Y. (2013) · Nucleic Acids Research · doi:10.1093/nar/gkt646 · Cited by 2,099
Bertoni, M., Kiefer, F., Biasini, M., Bordoli, L., & Schwede, T. (2017) · Scientific Reports · doi:10.1038/s41598-017-09654-8 · Cited by 866
US-align: universal structure alignments of proteins, nucleic acids, and macromolecular complexes
Zhang, C., Shine, M., Pyle, A. M., & Zhang, Y. (2022) · Nature Methods · doi:10.1038/s41592-022-01585-1 · Cited by 511
Self-citationAI-based structure prediction empowers integrative structural analysis of human nuclear pores
Mosalaganti, S., Obarska-Kosinska, A., Siggel, M., Taniguchi, R., Turoňová, B., Zimmerli, C. E., Buczak, K., Schmidt, F. H., Margiotta, E., Mackmull, M.-T., et al. (2022) · Science · doi:10.1126/science.abm9506 · Cited by 355
MMDB and VAST+: tracking structural similarities between macromolecular complexes
Madej, T., Lanczycki, C. J., Zhang, D., Thiessen, P. A., Geer, R. C., Marchler-Bauer, A., & Bryant, S. H. (2014) · Nucleic Acids Research · doi:10.1093/nar/gkt1208 · Cited by 339
Metadata
- Authors
- Mukherjee, S., & Zhang, Y.
- Venue
- Nucleic Acids Research
- Publisher
- Oxford University Press (OUP)
- Published
- 2009-05-14
- Volume
- 37
- Issue
- 11
- Pages
- e83-e83
- ISSN
- 0305-1048 (ISSN-L)
- 1362-4962
- OpenAlex
- W2046986600
- Cited by
- 181
- References
- 5
- FWCI
- 1.20
- 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: MM-align: a quick algorithm for aligning multiple-chain protein complex structures using iterative dynamic programming. https://app.cochat.ai/papers/10.1093/nar/gkp318
- The paper
- Mukherjee, S., & Zhang, Y. (2009). MM-align: a quick algorithm for aligning multiple-chain protein complex structures using iterative dynamic programming. Nucleic Acids Research. https://doi.org/10.1093/nar/gkp318
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.