Result for 53E51B4874BA921D07C2D4EDB2751CC484DC8A7C

Query result

Key Value
FileName./usr/bin/DBtrim
FileSize133136
MD5CA193D36BC0E1BC35A017357EDE97425
SHA-153E51B4874BA921D07C2D4EDB2751CC484DC8A7C
SHA-256ABD543A547007764F57BFA06F44691AC357952B0E6E70CD45F954870AE23827C
SSDEEP1536:ijgumqwX9Xd9J7xQx6oXRWRh+NTEXXp228BrpEy:ijgeOBdHuX+h+NO8Uy
TLSHT19ED31827214C5B0EDB92347B079EAD5637A53C1B037187D7B840036BAFBC72AE60A95D
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