Result for 811C602B718FC9A87D3A4B7A801CD10842ADEBC5

Query result

Key Value
FileName./usr/bin/DBtrim
FileSize71024
MD55015F61C0306EC75F9DD9C854AB2926E
SHA-1811C602B718FC9A87D3A4B7A801CD10842ADEBC5
SHA-256F65BFD03FD1D8DB14C1478B53C048314344BC98C48C24BBF36A9C10CCA819414
SSDEEP1536:R3onvvemUsg5OnBa/2I38PF4yYVkZ28tqijneB7g2e:RoQNqZ287IM
TLSHT1A36309A2EF0B2E16E0DACF304535E1E6133C6C6726575352EFCD0674274BA9ACF99086
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
FileSize138012
MD561E5A927918360930BD8B295BAAA1B71
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-10356C6E4FFCA00FA0505C089FAB7C22EAF3C4CD2
SHA-2564E189005087B72158F41D11645E9F80DC5CAA10BD6E73C5DF77725F4D57BE76A