Zobrazeno 1 - 10
of 77
pro vyhledávání: '"Limasset, Antoine"'
Minimal perfect hashing is the problem of mapping a static set of $n$ distinct keys into the address space $\{1,\ldots,n\}$ bijectively. It is well-known that $n\log_2(e)$ bits are necessary to specify a minimal perfect hash function (MPHF) $f$, when
Externí odkaz:
http://arxiv.org/abs/2210.13097
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Bioinformatics 36(5) 1374-1381 (2020)
Motivations Short-read accuracy is important for downstream analyses such as genome assembly and hybrid long-read correction. Despite much work on short-read correction, present-day correctors either do not scale well on large data sets or consider r
Externí odkaz:
http://arxiv.org/abs/1711.03336
Indexing massive data sets is extremely expensive for large scale problems. In many fields, huge amounts of data are currently generated, however extracting meaningful information from voluminous data sets, such as computing similarity between elemen
Externí odkaz:
http://arxiv.org/abs/1703.00667
Minimal perfect hash functions provide space-efficient and collision-free hashing on static sets. Existing algorithms and implementations that build such functions have practical limitations on the number of input elements they can process, due to hi
Externí odkaz:
http://arxiv.org/abs/1702.03154
Genomic and metagenomic fields, generating huge sets of short genomic sequences, brought their own share of high performance problems. To extract relevant pieces of information from the huge data sets generated by current sequencing techniques, one m
Externí odkaz:
http://arxiv.org/abs/1605.08319
Background Next Generation Sequencing (NGS) has dramatically enhanced our ability to sequence genomes, but not to assemble them. In practice, many published genome sequences remain in the state of a large set of contigs. Each contig describes the seq
Externí odkaz:
http://arxiv.org/abs/1505.04911
Publikováno v:
Bioinformatics; 2024 Supplement, Vol. 40, pi48-i57, 10p
Publikováno v:
In Discrete Applied Mathematics 15 March 2020 274:92-102