lphash

Limasset, Antoine; Shibuya, Yoshihiro; Pibiri, Giulio Ermanno

Document type :

Autre communication scientifique (congrès sans actes - poster - séminaire...)

Title :

lphash

Author(s) :

Limasset, Antoine [Auteur]

Centre National de la Recherche Scientifique [CNRS]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Shibuya, Yoshihiro [Auteur]
Laboratoire d'Informatique Gaspard-Monge [LIGM]
Pibiri, Giulio Ermanno [Auteur]

English keyword(s) :

Minimal perfect hash function
indexing
kmers

HAL domain(s) :

Informatique [cs]/Bio-informatique [q-bio.QM]

English abstract : [en]

LPHash is a minimal perfect hash function (or MPHF) designed for k-mer sets where overlaps of k-1 bases between consecutive k-mers are exploited to:Reduce the space of the data structure. For example, with the right ...
Show more >LPHash is a minimal perfect hash function (or MPHF) designed for k-mer sets where overlaps of k-1 bases between consecutive k-mers are exploited to:Reduce the space of the data structure. For example, with the right combination of parameters, LPHash is able to achive < 0.9 bits/k-mer in practice whereas the known theoretical lower-bound of a classic MPHF is 1.44 bits/k-mer and practical constructions take 2-3 bits/k-mer.Boost the evaluation speed of queries performed for consecutive k-mers.Preserve the locality of k-mers: consecutive k-mers are likely to receive consecutive hash codes.The data structure and its construction/query algorithms are described in the paper Locality-Preserving Minimal Perfect Hashing of k-mers [1].Show less >

Language :

Anglais

ANR Project :

Structures de graphe adaptées pour l'exploration de données de séquençage de troisième génération

Collections :

Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL

Files

document
Open access
Access the document

lphash-main.zip
Open access
Access the document

lphash BibTeX CSV Excel RIS

Files

lphash

BibTeX

CSV

Excel

RIS