Approximate hashing for bioinformatics

DOI10.1007/978-3-030-79121-6_15OpenAlexW3166604620MaRDI QIDQ2117679FDOQ2117679

Authors: Guy Arbitman, Shmuel T. Klein, Pierre Peterlongo, Dana Shapira 

Publication date: 22 March 2022

Full work available at URL: https://hal.inria.fr/hal-03166000

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Efficient randomized pattern-matching algorithms
• Faster algorithms for string matching with k mismatches
• Similarity based deduplication with small data chunks
• A randomized algorithm for approximate string matching

Uses Software

• Cd-hit

This page was built for publication: Approximate hashing for bioinformatics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117679)