Result for 3362A8BAFE2BE08AB5A1D175BC77C0F58E67C2F5

Query result

Key Value
FileName./usr/bin/DBdust
FileSize75712
MD5C8690135A5F8406F689A23828EC02C86
SHA-13362A8BAFE2BE08AB5A1D175BC77C0F58E67C2F5
SHA-256F689148122A9A434E0130579A7747DD862F567227FFDDB68DE65DF4B5EC36C7F
SSDEEP768:NXSs/RDVZETw129e5icI9unWHQ0lN+6n4RxcMN7li9yUgS6gml1enxT2e6+4I4iP:04Rn2I5iEnX0lU6cli8/LX6J0zBuZ
TLSHT1B573F99B6532C9E6D4B13BB3835B9B72936339391BCB1E4CDF1ED71028A23544B04AB5
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
FileSize174076
MD5D126BB21C2EDC1EA6566E70134453A96
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-16296841A108F0D5E8B46B5ECA861223A85A2C175
SHA-256CB8FD5D3AE47FF9130D3CBCE53C52F11FDBA6C8DAA712BB73C19DEBB34683B86