Approximate String Matching with Variable Length Don't Care Characters

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 1996-09-25

著者

• Akutsu Tatsuya

  Human Genome Center Institute Of Medical Science The University Of Tokyo

関連論文

• Protein Structure Alignment Using Dynamic Programming and Iterative Improvement
• Approximate String Matching with Variable Length Don't Care Characters

スポンサーリンク