Result for 21E96B49A222E6D76F6BAAF55876A42E4C6416E6

Query result

Key Value
FileName./usr/bin/DBrm
FileSize71616
MD5F6659CF6274A400BF1A30D1E94C9A891
SHA-121E96B49A222E6D76F6BAAF55876A42E4C6416E6
SHA-256C3CFAE25D1C3577D8704F127AC5BFE73D81933DC53E0ED12A87C8AA86FFAADAB
SSDEEP768:ULGqRtn5pwY5bR7UyDEU6XZW77sxXuhXtiYXgibdzbOLKbJ8umUEu5i3E+mKV7sm:UVtn5iYHfDiXZmyXmxhVnqMA3vF70p
TLSHT171634CADFA0FB996E283D376EE8903707237658C930351D1780B0399B69E7AD5EB1160
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
FileSize153160
MD556A3611C511BDE7C6C848CDA9650A6CF
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.
PackageMaintainerDebian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageNamedazzdb
PackageSectionscience
PackageVersion1.0+git20180908.0bd5e07-1
SHA-151C416CDB923A0E1279D0048F65FE707E8E2111C
SHA-256D949539EA34D7A8329292F8E640EDC586904F849A6A0BF35D2C9B1398C4D5E60