Result for 61A16D53B832C2341055AD5B3AE24AF3189BFCF2

Query result

Key Value
FileName./usr/bin/rangen
FileSize13672
MD542235B12F6F27CDA6D21F246B532E235
SHA-161A16D53B832C2341055AD5B3AE24AF3189BFCF2
SHA-256D0E410CFA5DAAAAF3ADE26ED4DD8E816747883F5EFA500A83AB313B5B6234861
SSDEEP96:RuI70rqB+B14X3QaYj3EeO7oxkjAeN1TM06RErRDotl4DkT87V5/+afhVa:RLw74X3QHj3EeO7hjfNtMaRD1kI7d
TLSHT18E52F81A7FC7D472C1E3133C055B5F0931719490A3A39363BB1B731A3952B596A72AB3
hashlookup:parent-total1
hashlookup:trust55

Network graph view

Parents (Total: 1)

The searched file hash is included in 1 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
FileSize161048
MD54B68F8F2FBE572EFADB64549EAEDEA2A
PackageDescriptionmanage nucleotide sequencing read data To facilitate the multiple phases of the dazzler assembler, all the read data is organized into what is effectively a database of the reads and their meta-information. The design goals for this data base are as follows: * The database stores the source Pacbio read information in such a way that it can re-create the original input data, thus permitting a user to remove the (effectively redundant) source files. This avoids duplicating the same data, once in the source file and once in the database. * The data base can be built up incrementally, that is new sequence data can be added to the data base over time. * The data base flexibly allows one to store any meta-data desired for reads. This is accomplished with the concept of *tracks* that implementors can add as they need them. * The data is held in a compressed form equivalent to the .dexta and .dexqv files of the data extraction module. Both the .fasta and .quiva information for each read is held in the data base and can be recreated from it. The .quiva information can be added separately and later on if desired. * To facilitate job parallel, cluster operation of the phases of the assembler, the database has a concept of a *current partitioning* in which all the reads that are over a given length and optionally unique to a well, are divided up into *blocks* containing roughly a given number of bases, except possibly the last block which may have a short count. Often programs can be run on blocks or pairs of blocks and each such job is reasonably well balanced as the blocks are all the same size. One must be careful about changing the partition during an assembly as doing so can void the structural validity of any interim block-based results.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamedazzdb
PackageSectionscience
PackageVersion1.0+git20180908.0bd5e07-1
SHA-14203DFFFEFFE5BD576F0132CA41A15B0ED548B5C
SHA-2565E4C2D680AF910A99774A574F0BAC47D56941FD91F98AF43D90398B010FE8760