Compacting a dynamic edit distance table by RLE compression

Heikki Hyyrö, Shunsuke Inenaga

研究成果: 著書/レポートタイプへの貢献会議での発言

2 引用 (Scopus)

抄録

Kim and Park [A dynamic edit distance table, J. Disc. Algo., 2:302–312, 2004] proposed a method (KP) based on a “dynamic edit distance table” that allows one to efficiently maintain edit distance information between two strings A of length m and B of length n when the strings can be modified by single-character edits to their left or right ends. This type of computation is useful e.g. in cyclic string comparison. KP uses linear time, O(m + n), to update the distance representation after each single edit. As noted in a recent extension of KP by Hyyrö et al. [Incremental string comparison, J. Disc. Algo., 34:2-17, 2015], a practical bottleneck is that the method needs Θ(mn) space to store a representation of a complete m×n edit distance table. In this paper we take the first steps towards reducing the space usage by RLE compressing A and B. Let M and N be the lengths of RLE compressed versions of A and B, respectively. We propose how to store the edit distance table using Θ(mN + Mn) space while maintaining the same time complexity as the original method that does not use compression.

元の言語英語
ホスト出版物のタイトルSOFSEM 2016
ホスト出版物のサブタイトルTheory and Practice of Computer Science - 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
編集者Rūsiņš Mārtiņš Freivalds, Gregor Engels, Barbara Catania
出版者Springer Verlag
ページ302-313
ページ数12
ISBN(印刷物)9783662491911
DOI
出版物ステータス出版済み - 1 1 2016
イベント42nd International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2016 - Harrachov, チェコ共和国
継続期間: 1 23 20161 28 2016

出版物シリーズ

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

その他

その他42nd International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2016
チェコ共和国
Harrachov
期間1/23/161/28/16

Fingerprint

Edit Distance
Table
Compression
Strings
Time Complexity
Linear Time
Update

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Hyyrö, H., & Inenaga, S. (2016). Compacting a dynamic edit distance table by RLE compression. : R. M. Freivalds, G. Engels, & B. Catania (版), SOFSEM 2016: Theory and Practice of Computer Science - 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings (pp. 302-313). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 9587). Springer Verlag. https://doi.org/10.1007/978-3-662-49192-8_25

Compacting a dynamic edit distance table by RLE compression. / Hyyrö, Heikki; Inenaga, Shunsuke.

SOFSEM 2016: Theory and Practice of Computer Science - 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. 版 / Rūsiņš Mārtiņš Freivalds; Gregor Engels; Barbara Catania. Springer Verlag, 2016. p. 302-313 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻 9587).

研究成果: 著書/レポートタイプへの貢献会議での発言

Hyyrö, H & Inenaga, S 2016, Compacting a dynamic edit distance table by RLE compression. : RM Freivalds, G Engels & B Catania (版), SOFSEM 2016: Theory and Practice of Computer Science - 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 9587, Springer Verlag, pp. 302-313, 42nd International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2016, Harrachov, チェコ共和国, 1/23/16. https://doi.org/10.1007/978-3-662-49192-8_25
Hyyrö H, Inenaga S. Compacting a dynamic edit distance table by RLE compression. : Freivalds RM, Engels G, Catania B, 編集者, SOFSEM 2016: Theory and Practice of Computer Science - 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Springer Verlag. 2016. p. 302-313. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-662-49192-8_25
Hyyrö, Heikki ; Inenaga, Shunsuke. / Compacting a dynamic edit distance table by RLE compression. SOFSEM 2016: Theory and Practice of Computer Science - 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. 編集者 / Rūsiņš Mārtiņš Freivalds ; Gregor Engels ; Barbara Catania. Springer Verlag, 2016. pp. 302-313 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{7df09d6b878d41d3902ecdd8861c1f18,
title = "Compacting a dynamic edit distance table by RLE compression",
abstract = "Kim and Park [A dynamic edit distance table, J. Disc. Algo., 2:302–312, 2004] proposed a method (KP) based on a “dynamic edit distance table” that allows one to efficiently maintain edit distance information between two strings A of length m and B of length n when the strings can be modified by single-character edits to their left or right ends. This type of computation is useful e.g. in cyclic string comparison. KP uses linear time, O(m + n), to update the distance representation after each single edit. As noted in a recent extension of KP by Hyyr{\"o} et al. [Incremental string comparison, J. Disc. Algo., 34:2-17, 2015], a practical bottleneck is that the method needs Θ(mn) space to store a representation of a complete m×n edit distance table. In this paper we take the first steps towards reducing the space usage by RLE compressing A and B. Let M and N be the lengths of RLE compressed versions of A and B, respectively. We propose how to store the edit distance table using Θ(mN + Mn) space while maintaining the same time complexity as the original method that does not use compression.",
author = "Heikki Hyyr{\"o} and Shunsuke Inenaga",
year = "2016",
month = "1",
day = "1",
doi = "10.1007/978-3-662-49192-8_25",
language = "English",
isbn = "9783662491911",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "302--313",
editor = "Freivalds, {Rūsiņš Mārtiņš} and Gregor Engels and Barbara Catania",
booktitle = "SOFSEM 2016",
address = "Germany",

}

TY - GEN

T1 - Compacting a dynamic edit distance table by RLE compression

AU - Hyyrö, Heikki

AU - Inenaga, Shunsuke

PY - 2016/1/1

Y1 - 2016/1/1

N2 - Kim and Park [A dynamic edit distance table, J. Disc. Algo., 2:302–312, 2004] proposed a method (KP) based on a “dynamic edit distance table” that allows one to efficiently maintain edit distance information between two strings A of length m and B of length n when the strings can be modified by single-character edits to their left or right ends. This type of computation is useful e.g. in cyclic string comparison. KP uses linear time, O(m + n), to update the distance representation after each single edit. As noted in a recent extension of KP by Hyyrö et al. [Incremental string comparison, J. Disc. Algo., 34:2-17, 2015], a practical bottleneck is that the method needs Θ(mn) space to store a representation of a complete m×n edit distance table. In this paper we take the first steps towards reducing the space usage by RLE compressing A and B. Let M and N be the lengths of RLE compressed versions of A and B, respectively. We propose how to store the edit distance table using Θ(mN + Mn) space while maintaining the same time complexity as the original method that does not use compression.

AB - Kim and Park [A dynamic edit distance table, J. Disc. Algo., 2:302–312, 2004] proposed a method (KP) based on a “dynamic edit distance table” that allows one to efficiently maintain edit distance information between two strings A of length m and B of length n when the strings can be modified by single-character edits to their left or right ends. This type of computation is useful e.g. in cyclic string comparison. KP uses linear time, O(m + n), to update the distance representation after each single edit. As noted in a recent extension of KP by Hyyrö et al. [Incremental string comparison, J. Disc. Algo., 34:2-17, 2015], a practical bottleneck is that the method needs Θ(mn) space to store a representation of a complete m×n edit distance table. In this paper we take the first steps towards reducing the space usage by RLE compressing A and B. Let M and N be the lengths of RLE compressed versions of A and B, respectively. We propose how to store the edit distance table using Θ(mN + Mn) space while maintaining the same time complexity as the original method that does not use compression.

UR - http://www.scopus.com/inward/record.url?scp=84956657208&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84956657208&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-49192-8_25

DO - 10.1007/978-3-662-49192-8_25

M3 - Conference contribution

SN - 9783662491911

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 302

EP - 313

BT - SOFSEM 2016

A2 - Freivalds, Rūsiņš Mārtiņš

A2 - Engels, Gregor

A2 - Catania, Barbara

PB - Springer Verlag

ER -