Keywords
ComputationTree (set theory)AlgorithmDegrees of freedom (physics and chemistry)Computer scienceSubdivisionClass (philosophy)PhysicsMathematicsCombinatorics
Affiliated Institutions
Related Publications
All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
Weighted paths in directed grid graphs of dimension (m X n) can be used to model the string edit problem, which consists of obtaining optimal (weighted) alignments between subst...
A simple divide-and-conquer algorithm for computing Delaunay triangulations in O(n log log n) expected time
We present a modification to the divide-and-conquer algorithm of Guibas & Stolfi [GS] for computing the Delaunay triangulation of n sites in the plane. The change reduces its T(...
IQPNNI: Moving Fast Through Tree Space and Stopping in Time
An efficient tree reconstruction method (IQPNNI) is introduced to reconstruct a phylogenetic tree based on DNA or amino acid sequence data. Our approach combines various fast al...
The Distribution of Linear Combinations of<i>t</i>-Variables
Abstract The distribution of an arbitrary linear combination of Student-t random variables with odd degrees of freedom is derived. An easy method of expressing this distribution...
An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score
In this paper, we present an $O(N^2 \log ^2 )$ algorithm for finding the two nonoverlapping substrings of a given string of length N which have the highest-scoring alignment bet...
Publication Info
- Year
- 1986
- Type
- article
- Volume
- 324
- Issue
- 6096
- Pages
- 446-449
- Citations
- 3542
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
3542
OpenAlex
Cite This
Josh Barnes,
Piet Hut
(1986).
A hierarchical O(N log N) force-calculation algorithm.
Nature
, 324
(6096)
, 446-449.
https://doi.org/10.1038/324446a0
Identifiers
- DOI
- 10.1038/324446a0