The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
On the Theory and Computation of Evolutionary Distances
Abstract
This paper gives a formal definition of the biological concept of evolutionary distance and an algorithm to compute it. For any set S of finite sequences of varying lengths this distance is a real-valued function on $S \times S$, and it is shown to be a metric under conditions which are wide enough to include the biological application. The algorithm, introduced here, lends itself to computer programming and provides a method to compute evolutionary distance which is shorter than the other methods currently in use.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Needleman, S. B., & Wunsch, C. D. (1970) · Journal of Molecular Biology · doi:10.1016/0022-2836(70)90057-4 · Cited by 11,288
Fitch, W. M., & Margoliash, E. (1967) · Science · doi:10.1126/science.155.3760.279 · Cited by 3,610
Matching Sequences under Deletion/Insertion Constraints
Sankoff, D. (1972) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.69.1.4 · Cited by 296
Cited by
Basic local alignment search tool
Altschul, S. F., Gish, W., Miller, W., Myers, E. W., & Lipman, D. J. (1990) · Journal of Molecular Biology · doi:10.1006/jmbi.1990.9999 · Cited by 98,669
Identification of common molecular subsequences
Smith, T. F., & Waterman, M. S. (1981) · Journal of Molecular Biology · doi:10.1016/0022-2836(81)90087-5 · Cited by 9,940
Rapid and sensitive protein similarity searches
Lipman, D. J., & Pearson, W. R. (1985) · Science · doi:10.1126/science.2983426 · Cited by 4,033
A guided tour to approximate string matching
Navarro, G. (2001) · ACM Computing Surveys · doi:10.1145/375360.375365 · Cited by 2,561
[5] Rapid and sensitive sequence comparison with FASTP and FASTA
Pearson, W. R. (1990) · Methods in Enzymology · doi:10.1016/0076-6879(90)83007-v · Cited by 1,946
Progressive sequence alignment as a prerequisitetto correct phylogenetic trees
Feng, D.-F., & Doolittle, R. F. (1987) · Journal of Molecular Evolution · doi:10.1007/bf02603120 · Cited by 1,883
An improved algorithm for matching biological sequences
Gotoh, O. (1982) · Journal of Molecular Biology · doi:10.1016/0022-2836(82)90398-9 · Cited by 1,724
Adaptive Computation and Machine Learning
(2012) · Boosting · doi:10.7551/mitpress/8291.003.0026 · Cited by 1,402
[47] Establishing homologies in protein sequences
Dayhoff, M. O., Barker, W. C., & Hunt, L. T. (1983) · Methods in Enzymology · doi:10.1016/s0076-6879(83)91049-2 · Cited by 1,169
A Normalized Levenshtein Distance Metric
Yujian, L., & Bo, L. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1078 · Cited by 986
A workbench for multiple alignment construction and analysis
Schuler, G. D., Altschul, S. F., & Lipman, D. J. (1991) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.340090304 · Cited by 985
Swarm: robust and fast clustering method for amplicon-based studies
Mahé, F., Rognes, T., Quince, C., de Vargas, C., & Dunthorn, M. (2014) · PeerJ · doi:10.7717/peerj.593 · Cited by 978
Similar Amino Acid Sequences: Chance or Common Ancestry?
Doolittle, R. F. (1981) · Science · doi:10.1126/science.7280687 · Cited by 843
Issues in searching molecular sequence databases
Altschul, S. F., Boguski, M. S., Gish, W., & Wootton, J. C. (1994) · Nature Genetics · doi:10.1038/ng0294-119 · Cited by 774
[27] Local alignment statistics
Altschul, S. F., & Gish, W. (1996) · Methods in Enzymology · doi:10.1016/s0076-6879(96)66029-7 · Cited by 723
Smith, T. F., & Waterman, M. S. (1981) · Advances in Applied Mathematics · doi:10.1016/0196-8858(81)90046-4 · Cited by 677
Amino acid substitution matrices from an information theoretic perspective
Altschul, S. F. (1991) · Journal of Molecular Biology · doi:10.1016/0022-2836(91)90193-a · Cited by 633
Algorithms for approximate string matching
Ukkonen, E. (1985) · Information and Control · doi:10.1016/s0019-9958(85)80046-2 · Cited by 610
Pearson, W. R. (1991) · Genomics · doi:10.1016/0888-7543(91)90071-l · Cited by 576
Simultaneous Solution of the RNA Folding, Alignment and Protosequence Problems
Sankoff, D. (1985) · SIAM Journal on Applied Mathematics · doi:10.1137/0145048 · Cited by 530
Metric-space analysis of spike trains: theory, algorithms and application
Victor, J. D., & Purpura, K. P. (1997) · Network: Computation in Neural Systems · doi:10.1088/0954-898x_8_2_003 · Cited by 426
Aligning amino acid sequences: Comparison of commonly used methods
Feng, D. F., Johnson, M. S., & Doolittle, R. F. (1985) · Journal of Molecular Evolution · doi:10.1007/bf02100085 · Cited by 391
Dynalign: an algorithm for finding the secondary structure common to two RNA sequences
Mathews, D. H., & Turner, D. H. (2002) · Journal of Molecular Biology · doi:10.1006/jmbi.2001.5351 · Cited by 372
Some biological sequence metrics
Waterman, M. S., Smith, T. F., & Beyer, W. A. (1976) · Advances in Mathematics · doi:10.1016/0001-8708(76)90202-4 · Cited by 358
Brown, G. G., Gadaleta, G., Pepe, G., Saccone, C., & Sbisà, E. (1986) · Journal of Molecular Biology · doi:10.1016/0022-2836(86)90272-x · Cited by 353
A flexible motif search technique based on generalized profiles
Bucher, P., Karplus, K., Moeri, N., & Hofmann, K. (1996) · Computers & Chemistry · doi:10.1016/s0097-8485(96)80003-9 · Cited by 316
Johnstone, E. M., Chaney, M. O., Norris, F. H., Pascual, R., & Little, S. P. (1991) · Molecular Brain Research · doi:10.1016/0169-328x(91)90088-f · Cited by 316
RNA secondary structure: a complete mathematical analysis
Waterman, M. S., & Smith, T. F. (1978) · Mathematical Biosciences · doi:10.1016/0025-5564(78)90099-8 · Cited by 270
The alignment of sets of sequences and the construction of phyletic trees: An integrated method
Hogeweg, P., & Hesper, B. (1984) · Journal of Molecular Evolution · doi:10.1007/bf02257378 · Cited by 263
Metadata
- Authors
- Sellers, P. H.
- Venue
- SIAM Journal on Applied Mathematics
- Published
- 1974-06
- Volume
- 26
- Issue
- 4
- Pages
- 787-793
- ISSN
- 0036-1399 (ISSN-L)
- 1095-712X
- OpenAlex
- W1977618577
- Cited by
- 474
- References
- 3
- FWCI
- 0.57
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.