Result for 1232D515D54E65529EDC7FF95C234B31A28E0C7F

Query result

Key Value
FileName./usr/bin/DBdust
FileSize80200
MD56B71CD3C4A5C5028E2FF9F0A1D0A8485
SHA-11232D515D54E65529EDC7FF95C234B31A28E0C7F
SHA-256FB08ED33CD3E03F513BF6A5ADF9283F3C0C66C8E342CB19AA745A1B6285F299A
SSDEEP1536:DCYNJENVFZKhTud0aw0++TT9ji+E/zoYm:uQVudPw0TTwX/zo
TLSHT1EA733A0AB4A314BCC595D4308FFFD2526A70B46156335A3F2845BB353E9AE780BADE21
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
FileSize196656
MD5898C25BBECBCB444123245E78B508771
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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamedazzdb
PackageSectionscience
PackageVersion1.0+git20190616.034f1ab-1
SHA-123F6AD3DAA1E189A379E7E1463D521E03C4EB139
SHA-2566C5D0EA30AE349BB2B5412DFB55642ECE0866648B115659E2D91FF1C522E5BCB