Result for 00621F0F43A1780786D718D320596853EB1C0402

Query result

Key Value
FileName./usr/bin/DBstats
FileSize80040
MD52C176C64DE13B7D91065EF0CEF5C2D1B
SHA-100621F0F43A1780786D718D320596853EB1C0402
SHA-2561C139CEAC17B973D4140C711EF5E9539D659C9DF9165F935CF4F703A38F8AC6A
SSDEEP1536:I+BbmqJ86Dyo1I6jsazeEbVELdUz703en0r6hHR:HBbFJOo1tGcVERkgen0mhH
TLSHT1C6733909B5A614FCC196C4308FBE92636E70B81686336B7F2445AB343F5BE741B5EE21
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
FileSize209744
MD51F9C74E90F200A3F410BAEA7D0F5B4AA
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+git20201103.8d98c37-1+deb11u1
SHA-103A15530972D8E5118F316404A11603D69E1BE13
SHA-256CD9D950C61320CC1075345393847D025535E803FBA921A3DDC1029437F4DE3D3