A Fast Algorithm for Approximate String Matching on Gene Sequences
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 79-90
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Approximate Regular Expression Searching with Arbitrary Integer WeightsLecture Notes in Computer Science, 2003
- Fast Regular Expression Search1999
- Boyer-Moore strategy to efficient approximate string matching1996
- Fast String Matching with MismatchesInformation and Computation, 1994
- Approximate Boyer–Moore String MatchingSIAM Journal on Computing, 1993
- A new approach to text searchingCommunications of the ACM, 1992
- Nomenclature for incompletely specified bases in nucleic acid sequences: rcommendations 1984Nucleic Acids Research, 1985
- Practical fast searching in stringsSoftware: Practice and Experience, 1980
- A fast string searching algorithmCommunications of the ACM, 1977