Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,275,343 papers from all fields of science
Search
Sign In
Create Free Account
algorithm
Known as:
Algorithms
A defined procedure for solving a problem. Applied to a problem-solving procedure implemented in software to be executed by a computer.
National Institutes of Health
Create Alert
Alert
Related topics
Related topics
5 relations
Artificial Intelligence
Computer Programing
Computer software
Mathematics
Narrower (1)
Self-Organizing Map
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
SHELXT – Integrated space-group and crystal-structure determination
G. Sheldrick
Acta Crystallographica Section A: Foundations and…
2015
Corpus ID: 16478757
SHELXT automates routine small-molecule structure determination starting from single-crystal reflection data, the Laue group and…
Expand
Highly Cited
2012
Highly Cited
2012
Fiji: an open-source platform for biological-image analysis
J. Schindelin
,
Ignacio Arganda-Carreras
,
+13 authors
A. Cardona
Nature Methods
2012
Corpus ID: 205420589
Fiji is a distribution of the popular open-source software ImageJ focused on biological-image analysis. Fiji uses modern software…
Expand
Highly Cited
2012
Highly Cited
2012
Fast gapped-read alignment with Bowtie 2
Ben Langmead
,
S. Salzberg
Nature Methods
2012
Corpus ID: 205420407
As the rate of sequencing increases, greater throughput is demanded from read aligners. The full-text minute index is often used…
Expand
Highly Cited
2012
Highly Cited
2012
CircadiOmics: integrating circadian genomics, transcriptomics, proteomics and metabolomics
D. Darriba
,
G. L. Taboada
,
R. Doallo
,
D. Posada
Nature Methods
2012
Corpus ID: 26387069
jModelTest 2 is written in Java, and it can run on Windows, Macintosh and Linux platforms. Source code and binaries are freely…
Expand
Highly Cited
2011
Highly Cited
2011
MEGA5: molecular evolutionary genetics analysis using maximum likelihood, evolutionary distance, and maximum parsimony methods.
K. Tamura
,
D. Peterson
,
N. Peterson
,
G. Stecher
,
M. Nei
,
Sudhir Kumar
Molecular biology and evolution
2011
Corpus ID: 5902562
Comparative analysis of molecular sequence data is essential for reconstructing the evolutionary histories of species and…
Expand
Highly Cited
2007
Highly Cited
2007
Phaser crystallographic software
A. Mccoy
,
R. Grosse-Kunstleve
,
P. Adams
,
M. Winn
,
L. C. Storoni
,
R. Read
Journal of Applied Crystallography
2007
Corpus ID: 2653229
A description is given of Phaser-2.1: software for phasing macromolecular crystal structures by molecular replacement and single…
Expand
Highly Cited
2004
Highly Cited
2004
MUSCLE: multiple sequence alignment with high accuracy and high throughput.
Robert C. Edgar
Nucleic Acids Research
2004
Corpus ID: 14252825
We describe MUSCLE, a new computer program for creating multiple alignments of protein sequences. Elements of the algorithm…
Expand
Highly Cited
2003
Highly Cited
2003
A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood.
Stéphane Guindon
,
O. Gascuel
Systematic Biology
2003
Corpus ID: 13857323
The increase in the number of large data sets and the complexity of current probabilistic sequence evolution models necessitates…
Expand
Highly Cited
1996
Highly Cited
1996
Efficient iterative schemes for ab initio total-energy calculations using a plane-wave basis set.
G. Kresse
,
J. Furthmüller
Physical Review B (Condensed Matter)
1996
Corpus ID: 42302021
We present an efficient scheme for calculating the Kohn-Sham ground state of metallic systems using pseudopotentials and a plane…
Expand
Review
1995
Review
1995
Ab initio molecular dynamics for liquid metals.
G. Kresse
,
J. Hafner
Physical Review B (Condensed Matter)
1995
Corpus ID: 12788520
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE