@inproceedings{413b7189e4c14a7fb180126154eba09f,
title = "Approximate Hashing for Bioinformatics",
abstract = "The paper extends ideas from data compression by deduplication to the Bioinformatic field. The specific problems on which we show our approach to be useful are the clustering of a large set of DNA strings and the search for approximate matches of long substrings, both based on the design of what we call an approximate hashing function. The outcome of the new procedure is very similar to the clustering and search results obtained by accurate tools, but in much less time and with less required memory.",
author = "Guy Arbitman and Klein, {Shmuel T.} and Pierre Peterlongo and Dana Shapira",
note = "Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.; 25th International Conference on Implementation and Application of Automata, CIAA 2021 ; Conference date: 19-07-2021 Through 22-07-2021",
year = "2021",
doi = "10.1007/978-3-030-79121-6_15",
language = "אנגלית",
isbn = "9783030791209",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "178--189",
editor = "Sebastian Maneth",
booktitle = "Implementation and Application of Automata - 25th International Conference, CIAA 2021, Proceedings",
address = "גרמניה",
}