Result for 3902A1DCCC3B7ECAED1E4A70FDF477C5A4606AB6

Query result

Key Value
FileName./usr/bin/DBwipe
FileSize67188
MD5487DFC6AD4F2D196433C53ABF0B69CFF
SHA-13902A1DCCC3B7ECAED1E4A70FDF477C5A4606AB6
SHA-256443D7606D9E9D1EA4A8CA7257757D41FFF33716990CC2AFCB233197EC7D0AF1D
SSDEEP1536:UAtQ/VfYbgMMzxcsYuV9EwTSl46FqrRf:ru/abuzrpp9f
TLSHT1CD634DA3A783C4F1E77345F88786977B1D305F02B127E191FB493AC8BA362162E52365
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
FileSize138228
MD56098BD1B2144AB7BEB16935AF8EBB275
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+20161112-2
SHA-117415326C48CFA16EF89198255BE2CE6438E7CFF
SHA-2561757E54C2813D8D7C294543EB0362972C8635D56AACBD04B081AC5AFEB01215C