Result for 1958505461EB1D2DE5AACC0A95CEF7EFC910C4C1

Query result

Key Value
FileName./usr/bin/DBmv
FileSize62892
MD5239CDF394ACC62C062DCCD85B49A1318
SHA-11958505461EB1D2DE5AACC0A95CEF7EFC910C4C1
SHA-256730CCE289185A5781DE0D47A793F96CAF4A87AC8D50133A6AAE6A530FE3FF702
SSDEEP1536:tZxa0Hpjl/mKPNB+6supqnfrp41TY/J5RG2L7PO+gaur:Lxa0/mgVsupqftoTCnbbXc
TLSHT1A253086AFC62DB96C6D416F4B34D836473231378D2EB320AD91547206BBB82B4F3A705
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
FileSize150128
MD5C301A39744CDBA4D1908F199D3C5F6EB
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-122C3B4E0D7C8CD922209FA7B42D9A3019A3A002F
SHA-256574CA9353D701CCA849FDC10990EA445444D79BF64E45FC04910A9BE07C9F31E