An efficient string matching algorithm with K substitutions for nucleotide and amino acid sequences
- 1 June 1987
- journal article
- research article
- Published by Elsevier in Journal of Theoretical Biology
- Vol. 126 (4) , 483-490
- https://doi.org/10.1016/s0022-5193(87)80153-4
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Efficient string matching with k mismatchesTheoretical Computer Science, 1986
- An efficient string matching algorithm withkdifferences for nudeotide and amino acid sequencesNucleic Acids Research, 1986
- Confidence limits for homology in protein or gene sequencesJournal of Molecular Biology, 1985
- Fast optimal alignmentNucleic Acids Research, 1984
- Analysis of gene duplication repeats in the myosin rodJournal of Molecular Biology, 1983
- Efficient algorithms for searching for exact repetition of nucleotide sequencesJournal of Molecular Evolution, 1983
- An efficient code searching for sequence homology and DNA duplicationJournal of Theoretical Biology, 1983
- Pattern recognition in nucleic acid sequences. I. A general method for finding local homologies and symmetriesNucleic Acids Research, 1982
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970