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.
|Title of host publication||Implementation and Application of Automata - 25th International Conference, CIAA 2021, Proceedings|
|Publisher||Springer Science and Business Media Deutschland GmbH|
|Number of pages||12|
|State||Published - 2021|
|Event||25th International Conference on Implementation and Application of Automata, CIAA 2021 - Virtual, Online|
Duration: 19 Jul 2021 → 22 Jul 2021
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||25th International Conference on Implementation and Application of Automata, CIAA 2021|
|Period||19/07/21 → 22/07/21|
Bibliographical notePublisher Copyright:
© 2021, Springer Nature Switzerland AG.