Approximate string matching and local similarity
- 1 January 1994
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 259-273
- https://doi.org/10.1007/3-540-58094-8_23
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Approximate string matching in sublinear expected timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A contig assembly program based on sensitive detection of fragment overlapsGenomics, 1992
- A time-efficient, linear-space local similarity algorithmAdvances in Applied Mathematics, 1991
- Amino acid substitution matrices from an information theoretic perspectiveJournal of Molecular Biology, 1991
- Protein sequence comparison: methods and significanceProtein Engineering, Design and Selection, 1991
- Basic local alignment search toolJournal of Molecular Biology, 1990
- Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes.Proceedings of the National Academy of Sciences, 1990
- An improved algorithm for matching biological sequencesJournal of Molecular Biology, 1982
- 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