Martin Steinegger

Martin Steinegger

Top Cited Scholar 2026
Auto-generated profile, based on publicly available information

Martin Steinegger

School of Biological Sciences, Seoul National University, Seoul, South Korea

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 July 2021 in Nature
Verified
Journal Article
Open access
PDF file
JJJohn Jumper
John Jumper
RERichard Evans
Richard Evans
APAlexander Pritzel
Alexander Pritzel
TGTim Green
Tim Green
MFMichael Figurnov
Michael Figurnov
DHDemis Hassabis
Demis Hassabis
Proteins are essential to life, and understanding their structure can facilitate a mechanistic understanding of their function. Through an enormous experimental effort1–4, the structures of around 100,000 unique proteins have been determined5, but this represents a small fraction of the billions of known protein sequences6,7. Structural coverage is bottlenecked by the months to years of painstaking effort required to determine a single protein structure. Accurate computational approaches are needed to address this gap and to enable large-scale structural bioinformatics. Predicting the three-dimensional structure that a protein will adopt based solely on its amino acid sequence—the structure prediction component of the ‘protein folding problem’8—has been an important open research problem for more than 50 years9. Despite recent progress10–14, existing methods fall far short of atomic accuracy, especially when no homologous structure is available. Here we provide the first computational method that can regularly predict protein structures with atomic accuracy even in cases in which no similar structure is known. We validated an entirely redesigned version of our neural network-based model, AlphaFold, in the challenging 14th Critical Assessment of protein Structure Prediction (CASP14)15, demonstrating accuracy competitive with experimental structures in a majority of cases and greatly outperforming other methods. Underpinning the latest version of AlphaFold is a novel machine learning approach that incorporates physical and biological knowledge about protein structure, leveraging multi-sequence alignments, into the design of the deep learning algorithm.

30 May 2022 in Nature Methods
Verified
Journal Article
Open access
PDF file
MMMilot Mirdita
Milot Mirdita
KSKonstantin Schütze
Konstantin Schütze
YMYoshitaka Moriwaki
Yoshitaka Moriwaki
LHLim Heo
Lim Heo
SOSergey Ovchinnikov
Sergey Ovchinnikov
MSMartin Steinegger
Martin Steinegger
ColabFold offers accelerated prediction of protein structures and complexes by combining the fast homology search of MMseqs2 with AlphaFold2 or RoseTTAFold. ColabFold’s 40−60-fold faster search and optimized model utilization enables prediction of close to 1,000 structures per day on a server with one graphics processing unit. Coupled with Google Colaboratory, ColabFold becomes a free and accessible platform for protein folding. ColabFold is open-source software available at https://github.com/sokrypton/ColabFold and its novel environmental databases are available at https://colabfold.mmseqs.com.

16 October 2017 in Nature Biotechnology
Verified
Journal Article
Closed access
MSMartin Steinegger
Martin Steinegger
JSJohannes Söding
Johannes Söding

8 May 2023 in Nature Biotechnology
Verified
Journal Article
Open access
PDF file
MKMichel van Kempen
Michel van Kempen
SKStephanie S. Kim
Stephanie S. Kim
CTCharlotte Tumescheit
Charlotte Tumescheit
MMMilot Mirdita
Milot Mirdita
JLJeongjae Lee
Jeongjae Lee
MSMartin Steinegger
Martin Steinegger
As structure prediction methods are generating millions of publicly available protein structures, searching these databases is becoming a bottleneck. Foldseek aligns the structure of a query protein against a database by describing tertiary amino acid interactions within proteins as sequences over a structural alphabet. Foldseek decreases computation times by four to five orders of magnitude with 86%, 88% and 133% of the sensitivities of Dali, TM-align and CE, respectively.

14 September 2019 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
MSMartin Steinegger
Martin Steinegger
MMMarkus Meier
Markus Meier
MMMilot Mirdita
Milot Mirdita
HVHarald Vöhringer
Harald Vöhringer
SHStephan J. Haunsberger
Stephan J. Haunsberger
JSJohannes Söding
Johannes Söding
Background: HH-suite is a widely used open source software suite for sensitive sequence similarity searches and protein fold recognition. It is based on pairwise alignment of profile Hidden Markov models (HMMs), which represent multiple sequence alignments of homologous proteins. Results: We developed a single-instruction multiple-data (SIMD) vectorized implementation of the Viterbi algorithm for profile HMM alignment and introduced various other speed-ups. These accelerated the search methods HHsearch by a factor 4 and HHblits by a factor 2 over the previous version 2.0.16. HHblits3 is ∼10× faster than PSI-BLAST and ∼20× faster than HMMER3. Jobs to perform HHsearch and HHblits searches with many query profile HMMs can be parallelized over cores and over cluster servers using OpenMP and message passing interface (MPI). The free, open-source, GPLv3-licensed software is available at https://github.com/soedinglab/hh-suite. Conclusion: The added functionalities and increased speed of HHsearch and HHblits should facilitate their use in large-scale protein structure and function prediction, e.g. in metagenomics and genomics projects.

29 June 2018 in Nature Communications
Verified
Journal Article
Open access
PDF file
MSMartin Steinegger
Martin Steinegger
JSJohannes Söding
Johannes Söding
Metagenomic datasets contain billions of protein sequences that could greatly enhance large-scale functional annotation and structure prediction. Utilizing this enormous resource would require reducing its redundancy by similarity clustering. However, clustering hundreds of millions of sequences is impractical using current algorithms because their runtimes scale as the input set sizeNtimes the number of clustersK, which is typically of similar order asN, resulting in runtimes that increase almost quadratically withN. We developed Linclust, the first clustering algorithm whose runtime scales asN, independent ofK. It can also cluster datasets several times larger than the available main memory. We cluster 1.6 billion metagenomic sequence fragments in 10 h on a single server to 50% sequence identity, >1000 times faster than has been possible before. Linclust will help to unlock the great wealth contained in metagenomic and genomic sequence databases.