Keywords
SubstringSequence (biology)Matching (statistics)Integer (computer science)Function (biology)AlgorithmSpace (punctuation)Asymptotically optimal algorithmMathematicsComputer scienceDiscrete mathematicsData structureStatistics
Affiliated Institutions
Related Publications
IQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood Phylogenies
Large phylogenomics data sets require fast tree inference methods, especially for maximum-likelihood (ML) phylogenies. Fast programs exist, but due to inherent heuristics to fin...
Active Learning with Statistical Models
For many types of machine learning algorithms, one can compute the statistically `optimal' way to select training data. In this paper, we review how optimal data selection techn...
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...
Finite-Dimensional Approximation of Gaussian Processes
Gaussian process (GP) prediction suffers from O(n3) scaling with the data set size n. By using a finite-dimensional basis to approximate the GP predictor, the computational comp...
Real-space refinement in <i>PHENIX</i> for cryo-EM and crystallography
This article describes the implementation of real-space refinement in the phenix.real_space_refine program from the PHENIX suite. The use of a simplified refinement target funct...
Publication Info
- Year
- 1989
- Type
- article
- Volume
- 51
- Issue
- 1
- Pages
- 5-37
- Citations
- 105
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
105
OpenAlex
Cite This
Eugene W. Myers,
Webb Miller
(1989).
Approximate matching of regular expressions.
Bulletin of Mathematical Biology
, 51
(1)
, 5-37.
https://doi.org/10.1007/bf02458834
Identifiers
- DOI
- 10.1007/bf02458834