Refactor indexing logic using hash-based minimizer selection.
Updates indexing architecture to use hashing for minimizer distribution and introduces a new hash-based selection mechanism. Additionally, updates documentation references and implements a new script for converting MkDocs into a flat wiki structure.
This commit is contained in:
1 parent
755cf85334
commit
9da0876ee6
5 files changed
+686
-23
No files matched your search
@@ -259,3 +259,89 @@
|
||||
url = {https://doi.org/10.1186/s12864-015-1647-5},
|
||||
volume = 16,
|
||||
year = 2015}
|
||||
|
||||
@article{Roberts2004-rz,
|
||||
title = "{Reducing storage requirements for biological sequence
|
||||
comparison}",
|
||||
author = "Roberts, Michael and Hayes, Wayne and Hunt, Brian R and Mount,
|
||||
Stephen M and Yorke, James A",
|
||||
journal = "Bioinformatics (Oxford, England)",
|
||||
publisher = "Oxford University Press (OUP)",
|
||||
volume = 20,
|
||||
number = 18,
|
||||
pages = "3363--3369",
|
||||
abstract = "MOTIVATION: Comparison of nucleic acid and protein sequences is a
|
||||
fundamental tool of modern bioinformatics. A dominant method of
|
||||
such string matching is the 'seed-and-extend' approach, in which
|
||||
occurrences of short subsequences called 'seeds' are used to
|
||||
search for potentially longer matches in a large database of
|
||||
sequences. Each such potential match is then checked to see if it
|
||||
extends beyond the seed. To be effective, the seed-and-extend
|
||||
approach needs to catalogue seeds from virtually every substring
|
||||
in the database of search strings. Projects such as mammalian
|
||||
genome assemblies and large-scale protein matching, however, have
|
||||
such large sequence databases that the resulting list of seeds
|
||||
cannot be stored in RAM on a single computer. This significantly
|
||||
slows the matching process. RESULTS: We present a simple and
|
||||
elegant method in which only a small fraction of seeds, called
|
||||
'minimizers', needs to be stored. Using minimizers can speed up
|
||||
string-matching computations by a large factor while missing only
|
||||
a small fraction of the matches found using all seeds.",
|
||||
month = dec,
|
||||
year = 2004,
|
||||
url = "https://dx.doi.org/10.1093/bioinformatics/bth408",
|
||||
doi = "10.1093/bioinformatics/bth408",
|
||||
pmid = 15256412,
|
||||
issn = "1367-4803,1367-4811",
|
||||
language = "en"
|
||||
}
|
||||
|
||||
@INPROCEEDINGS{Steele2014-cz,
|
||||
title = "{Fast splittable pseudorandom number generators}",
|
||||
author = "Steele, Jr, Guy L and Lea, Doug and Flood, Christine H",
|
||||
booktitle = "{Proceedings of the 2014 ACM International Conference on Object
|
||||
Oriented Programming Systems Languages \& Applications}",
|
||||
publisher = "ACM",
|
||||
address = "New York, NY, USA",
|
||||
abstract = "We describe a new algorithm SplitMix for an object-oriented and
|
||||
splittable pseudorandom number generator (PRNG) that is quite
|
||||
fast: 9 64-bit arithmetic/logical operations per 64 bits
|
||||
generated. A conventional linear PRNG object provides a generate
|
||||
method that returns one pseudorandom value and updates the state
|
||||
of the PRNG, but a splittable PRNG object also has a second
|
||||
operation, split, that replaces the original PRNG object with two
|
||||
(seemingly) independent PRNG objects, by creating and returning a
|
||||
new such object and updating the state of the original object.
|
||||
Splittable PRNG objects make it easy to organize the use of
|
||||
pseudorandom numbers in multithreaded programs structured using
|
||||
fork-join parallelism. No locking or synchronization is required
|
||||
(other than the usual memory fence immediately after object
|
||||
creation). Because the generate method has no loops or
|
||||
conditionals, it is suitable for SIMD or GPU implementation. We
|
||||
derive SplitMix from the DotMix algorithm of Leiserson, Schardl,
|
||||
and Sukha by making a series of program transformations and
|
||||
engineering improvements. The end result is an object-oriented
|
||||
version of the purely functional API used in the Haskell library
|
||||
for over a decade, but SplitMix is faster and produces
|
||||
pseudorandom sequences of higher quality; it is also far superior
|
||||
in quality and speed to java.util.Random, and has been included
|
||||
in Java JDK8 as the class java.util.SplittableRandom. We have
|
||||
tested the pseudorandom sequences produced by SplitMix using two
|
||||
standard statistical test suites (DieHarder and TestU01) and they
|
||||
appear to be adequate for ``everyday'' use, such as in Monte
|
||||
Carlo algorithms and randomized data structures where speed is
|
||||
important.",
|
||||
month = oct,
|
||||
year = 2014,
|
||||
url = "http://dx.doi.org/10.1145/2660193.2660195",
|
||||
doi = "10.1145/2660193.2660195",
|
||||
isbn = 9781450325851
|
||||
}
|
||||
|
||||
@online{Stafford2011,
|
||||
author = {Stafford, David},
|
||||
title = {Better Bit Mixing - Improving on MurmurHash3's 64-bit Finalizer},
|
||||
date = {2011-09-28},
|
||||
url = {https://zimbry.blogspot.com/2011/09/better-bit-mixing-improving-on.html},
|
||||
urldate = {2026-09-12}
|
||||
}
|
||||
Reference in new issue
Block a user