Standard

Efficient high-similarity string comparison: The waterfall algorithm. / Tiskin, Alexander.

ACM International Conference Proceeding Series. 2013. p. 358-365.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Harvard

Tiskin, A 2013, Efficient high-similarity string comparison: The waterfall algorithm. in ACM International Conference Proceeding Series. pp. 358-365. https://doi.org/10.1145/2457317.2457384

APA

Tiskin, A. (2013). Efficient high-similarity string comparison: The waterfall algorithm. In ACM International Conference Proceeding Series (pp. 358-365) https://doi.org/10.1145/2457317.2457384

Vancouver

Tiskin A. Efficient high-similarity string comparison: The waterfall algorithm. In ACM International Conference Proceeding Series. 2013. p. 358-365 https://doi.org/10.1145/2457317.2457384

Author

Tiskin, Alexander. / Efficient high-similarity string comparison: The waterfall algorithm. ACM International Conference Proceeding Series. 2013. pp. 358-365

BibTeX

@inproceedings{6b48c54bf7c645c888c6e86f96e4e5bf,
title = "Efficient high-similarity string comparison: The waterfall algorithm",
abstract = "This paper outlines the design of a bit-parallel, multi-string algorithm for high-similarity string comparison. We present it in the framework for the longest common subsequence (LCS) problem developed by the author in [31]. The algorithm is based on a bit-parallel LCS algorithm by Crochemore et al. [14]. {\textcopyright} 2013 ACM.",
author = "Alexander Tiskin",
year = "2013",
month = may,
day = "2",
doi = "10.1145/2457317.2457384",
language = "English",
pages = "358--365",
booktitle = "ACM International Conference Proceeding Series",

}

RIS

TY - GEN

T1 - Efficient high-similarity string comparison: The waterfall algorithm

AU - Tiskin, Alexander

PY - 2013/5/2

Y1 - 2013/5/2

N2 - This paper outlines the design of a bit-parallel, multi-string algorithm for high-similarity string comparison. We present it in the framework for the longest common subsequence (LCS) problem developed by the author in [31]. The algorithm is based on a bit-parallel LCS algorithm by Crochemore et al. [14]. © 2013 ACM.

AB - This paper outlines the design of a bit-parallel, multi-string algorithm for high-similarity string comparison. We present it in the framework for the longest common subsequence (LCS) problem developed by the author in [31]. The algorithm is based on a bit-parallel LCS algorithm by Crochemore et al. [14]. © 2013 ACM.

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

U2 - 10.1145/2457317.2457384

DO - 10.1145/2457317.2457384

M3 - Conference contribution

AN - SCOPUS:84876807947

SP - 358

EP - 365

BT - ACM International Conference Proceeding Series

ER -

ID: 127708048