Result for 16EFFEA31DE3EB7539AB6ECE7549082F83D37B80

Query result

Key Value
FileName./usr/bin/DBstats
FileSize83968
MD5B16279240C82D71014F0BDAAE48C1A4E
SHA-116EFFEA31DE3EB7539AB6ECE7549082F83D37B80
SHA-256E81AE970F74CF8A0E659D3DE076361DB0DEC84E48402AB69EED976A552ED3611
SSDEEP1536:x139BLhLC8cfx9bP8EWrvPgks/lM9E/SvU5w1zLKx+rpO8lvzH3C:79H+x5EIke/sv1zLHrpOA
TLSHT127834B66AF0A2F16E0DB8F304575E1E6137C5CA362535711BBCD06BC2B0B68BDF99089
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
FileSize166084
MD5AAC056FD93971569922734DC5CA7A772
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
SHA-18C4A80B8EB1F515AE298EB61ABB3B992E39FAB75
SHA-256865168B623DB364D5265462F19CBBF300F3CD9CBBA37BD8039A645A8809E30B6