General methods of sequence comparison-Reference-Cited by-同舟云学术

General methods of sequence comparison

Published:1984-07 Issue:4 Volume:46 Page:473-500
ISSN:0092-8240
Container-title:Bulletin of Mathematical Biology
language:en
Short-container-title:Bltn Mathcal Biology

Author:

Waterman Michael S.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Agricultural and Biological Sciences,Pharmacology,General Environmental Science,General Biochemistry, Genetics and Molecular Biology,General Mathematics,Immunology,General Neuroscience

Link

http://link.springer.com/content/pdf/10.1007/BF02459498.pdf

Reference72 articles.

1. Aho, V. A., J. E. Hopcroft and J. D. Ullman. 1974.The Design and Analysis of Computer Algorithms. Addison-Wesley, Menlo Park, California.

2. Arratia, R. A. and M. S. Waterman. 1984. “An Erdos-Renyi Law with Shifts.”Adv. appl. Math. (in press).

3. Arratia, R. A., L. Gordon and M. S. Waterman. 1984. “An Extreme Value Distribution for Sequence Matching.” Manuscript.

4. Beyer, W. A., C. Burks and W. B. Goad. 1983. “Quantitative Comparison of DNA Sequences.”Los Alamos Sci. 9, 62–63.

5. —, M. L. Stein, T. F. Smith and S. M. Ulam. 1974. “A Molecular-sequence Metric and Evolutionary Trees.”Math Biosci. 19, 9–25.

Cited by 173 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Reducing the Data Cost of Machine Learning with AI: A Case Study;Transactions on Computational Science and Computational Intelligence;2021

2. Calibrating Seed-Based Heuristics to Map Short Reads With Sesame;Frontiers in Genetics;2020-06-25

3. A method based on the Levenshtein distance metric for the comparison of multiple movement patterns described by matrix sequences of different length;Expert Systems with Applications;2019-01

4. Maximal Motif Discovery in a Sliding Window;String Processing and Information Retrieval;2018

5. Number of distinct sequence alignments with k-match and match sections;Computers in Biology and Medicine;2015-08