Approximate string matching with variable length don't care characters

IEICE Transactions on Information and Systems

Volumn E79-D, Issue 9, 1996, Pages 1353-1354

  Akutsu, Tatsuya ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Algorithms; Approximate string matching; DNA sequence analysis; Pattern matching

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DNA SEQUENCES; PATTERN RECOGNITION; PROBLEM SOLVING;

APPROXIMATE STRING MATCHING; PATTERN MATCHING; VARIABLE LENGTH DON'T CARE CHARACTERS;

ALGORITHMS;

EID: 0030233898     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. T. Akutsu, "Approximate string matching with don't care characters," Information Processing Letters, vol.55, pp.235-239, 1995.
2. T. Akutsu, "Approximate string matching with variable length don't cares," Research Report, AL95-43-5, pp.3338, Information Processing Society of Japan, 1995.
3. C. Branden and J. Tooze, "Introduction to Protein Structure," Garland Publishing, New York, 1991.
4. M. Fisher and M. Paterson, "String matching and other products," Complexity of Computation, SIAM-ACM Proceedings 7, pp.113-125, 1974.
5. G. M. Landau and U. Vishkin, "Fast parallel and serial approximate string matching," Journal of Algorithms, vol.10, pp.157-169, 1989.
6. U. Manber and R. Baeza-Yates, "An algorithm for string matching with a sequence of don't cares," Information Processing Letters, vol.37, pp.133-136, 1991.
7. E.W. Myers and \V. Miller, "Approximate matching of regular expressions," Bulletin of Mathematical Biology, vol.51, pp.5-37, 1989.
8. K. Zhang, D. Shasha, and J. Wane, "Approximate tree matching in the presence of variable length don't cares," Journal of Algorithms, vol.16, pp.33-66, 1994.