For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Approximate String Matching with Variable Length Don't Care Characters
IEICE TRANSACTIONS on Information and Systems
Publication Date: 1996/09/25
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Algorithm and Computational Complexity
pattern matching, approximate string matching, algorithms, DNA sequence analysis,
Full Text: PDF>>
This paper presents an O(mn log n) time algorithm for an approximate string matching problem, in which a pattern string may contain variable length don't care characters. This problem is important for searching DNA sequences or amino acid sequences.