Keywords
GeneralityMatching (statistics)AlgorithmComputer scienceCore (optical fiber)Pattern matchingTheoretical computer scienceMathematicsArtificial intelligenceStatistics
Affiliated Institutions
Related Publications
Search and clustering orders of magnitude faster than BLAST
Abstract Motivation: Biological sequence data is accumulating rapidly, motivating the development of improved high-throughput methods for sequence classification. Results: UBLAS...
Combining many multiple alignments in one improved alignment.
Abstract MOTIVATION: The fact that the multiple sequence alignment problem is of high complexity has led to many different heuristic algorithms attempting to find a solution in ...
Designing Patterns and Profiles for Faster HMM Search
Profile HMMs are powerful tools for modeling conserved motifs in proteins. They are widely used by search tools to classify new protein sequences into families based on domain a...
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...
MUMmer4: A fast and versatile genome alignment system
The MUMmer system and the genome sequence aligner nucmer included within it are among the most widely used alignment packages in genomics. Since the last major release of MUMmer...
Publication Info
- Year
- 1982
- Type
- article
- Volume
- 162
- Issue
- 3
- Pages
- 705-708
- Citations
- 1732
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
1732
OpenAlex
Cite This
Osamu Gotoh
(1982).
An improved algorithm for matching biological sequences.
Journal of Molecular Biology
, 162
(3)
, 705-708.
https://doi.org/10.1016/0022-2836(82)90398-9
Identifiers
- DOI
- 10.1016/0022-2836(82)90398-9