Result for 2B281780E2A59AB764E4DDBD169DE4DC655DC8A0

Query result

Key Value
FileName./usr/bin/DBb2a
FileSize72200
MD5B58CE4D9235C906EC6F1B3CE661182A3
SHA-12B281780E2A59AB764E4DDBD169DE4DC655DC8A0
SHA-2561155E423B141E9D16B4AA7E302C06183B23E94717F23CF945D138757ADAD6818
SSDEEP1536:/YmtkGkcjTSKMytJIKLpkcqXQqlCNo8oSm/rbfGlBpo4A3:/YmtkGkcjTiokcqdQoSm/rbfMpzA
TLSHT122636C9DBB4F7996D2C7F278DB4942A1B22725DCE31390A1F406833CB14E78E9BB5424
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
FileSize183184
MD5BF923E85C90F8E770BBA6D2162E5ACC7
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+git20201103.8d98c37-1.1+b1
SHA-11011C91FC167030A0902204ABD9FE81F5D3D8BEB
SHA-2566DED8CE19D0463CBDF0467EE07F2EC99D89810DFE9ECE9FAF06A185811796441