Efficient algorithms for searching for exact repetition of nucleotide sequences
- 1 July 1983
- journal article
- Published by Springer Nature in Journal of Molecular Evolution
- Vol. 19 (3-4) , 283-285
- https://doi.org/10.1007/bf02099975
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Identification of common molecular subsequencesPublished by Elsevier ,2004
- Comparative biosequence metricsJournal of Molecular Evolution, 1981
- Algorithms for Loop MatchingsSIAM Journal on Applied Mathematics, 1978
- A fast string searching algorithmCommunications of the ACM, 1977
- Some biological sequence metricsAdvances in Mathematics, 1976
- Longest common subsequences of two random sequencesJournal of Applied Probability, 1975
- The String-to-String Correction ProblemJournal of the ACM, 1974
- Matching Sequences under Deletion/Insertion ConstraintsProceedings of the National Academy of Sciences, 1972
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970
- An improved method of testing for evolutionary homologyJournal of Molecular Biology, 1966