Keywords
Sequence (biology)Space (punctuation)LogarithmMathematicsSequence spaceComputational complexity theoryCombinatoricsAlgorithmDiscrete mathematicsApplied mathematicsMathematical optimizationMathematical analysisComputer science
Affiliated Institutions
Related Publications
A linear space algorithm for computing maximal common subsequences
The problem of finding a longest common subsequence of two strings has been solved in quadratic time and space. An algorithm is presented which will solve this problem in quadra...
Fast Kernels for String and Tree Matching
In this paper we present a new algorithm suitable for matching discrete objects such as strings and trees in linear time, thus obviating dynamic programming with quadratic time ...
Success of Phylogenetic Methods in the Four-Taxon Case
The success of 16 methods of phylogenetic inference was examined using consistency and simulation analysis. Success—the frequency with which a tree-making method correctly ident...
On the Quality of Spectral Separators
Computing graph separators is an important step in many graph algorithms. A popular technique for finding separators involves spectral methods. However, there has not been much ...
Automated generation of heuristics for biological sequence comparison
Abstract Background Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to i...
Publication Info
- Year
- 1999
- Type
- article
- Volume
- 58
- Issue
- 1
- Pages
- 137-147
- Citations
- 1161
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
1161
OpenAlex
Cite This
Noga Alon,
Yossi Matias,
Márió Szegedy
(1999).
The Space Complexity of Approximating the Frequency Moments.
Journal of Computer and System Sciences
, 58
(1)
, 137-147.
https://doi.org/10.1006/jcss.1997.1545
Identifiers
- DOI
- 10.1006/jcss.1997.1545