Result for 316F18BC19F1292F162D0FD25D13975DC149964D

Query result

Key Value
FileName./usr/bin/DBrm
FileSize133136
MD5CEEF9F47B457A46E41D17C8DA107B590
SHA-1316F18BC19F1292F162D0FD25D13975DC149964D
SHA-2561C7F11866FAE0ABB91BC2830BA885676AFEAAB4210DB45F9DF3FDB56E57FE52B
SSDEEP1536:UMqwO8T5kD5JZimzXHr8F7GBa3Jy8u7TruGT/5:Gf8TA7xXHruGBaU84b5
TLSHT134D31817248C5B0ADBD2257B478E6D4637A53C1713A287E7B800035FAFBD739E60A98D
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
FileSize171348
MD58399C29D57C1A70AFCE6BAC8E900C408
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-1AA53E2E503D1E1690CF09534EB574D53D06EF83E
SHA-256FBAEAF1730CB1B09BF08685D1F0FDE78E4A7D6514CEE84C1FEDFFEFB49599F98