The Library
Efficient high-similarity string comparison
Tools
Tiskin, Alexander (2013) Efficient high-similarity string comparison. In: EDBT '13 Proceedings of the Joint EDBT/ICDT, Genoa, Italy, 18-22 Mar 2013 pp. 358-365. ISBN 9781450315999 . doi:10.1145/2457317.2457384
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1145/2457317.2457384
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].
Item Type: | Conference Item (Paper) | ||||
---|---|---|---|---|---|
Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
Publisher: | ACM | ||||
ISBN: | 9781450315999 | ||||
Book Title: | Proceedings of the Joint EDBT/ICDT 2013 Workshops on - EDBT '13 | ||||
Official Date: | 2013 | ||||
Dates: |
|
||||
Page Range: | pp. 358-365 | ||||
DOI: | 10.1145/2457317.2457384 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Conference Paper Type: | Paper | ||||
Title of Event: | EDBT '13 Proceedings of the Joint EDBT/ICDT | ||||
Type of Event: | Workshop | ||||
Location of Event: | Genoa, Italy | ||||
Date(s) of Event: | 18-22 Mar 2013 |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |