Dynamic edit distance table under a general weighted cost function

Heikki Hyyrö, Kazuyuki Narisawa, Shunsuke Inenaga

研究成果: Conference contribution

3 被引用数 (Scopus)

抄録

String comparison is a fundamental task in theoretical computer science, with applications in e.g., spelling correction and computational biology. Edit distance is a classic similarity measure between two given strings A and B. It is the minimum total cost for transforming A into B, or vice versa, using three types of edit operations: single-character insertions, deletions, and/or substitutions.

本文言語English
ホスト出版物のタイトルSOFSEM 2010
ホスト出版物のサブタイトルTheory and Practice of Computer Science - 36th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
ページ515-527
ページ数13
DOI
出版ステータスPublished - 2010
イベント36th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2010 - Spindleruv Mlyn, Czech Republic
継続期間: 2010 1月 232010 1月 29

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5901 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other36th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2010
国/地域Czech Republic
CitySpindleruv Mlyn
Period10/1/2310/1/29

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Dynamic edit distance table under a general weighted cost function」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル