Result for 1426027C783689200B27C5A48199DFBF0F43AB6D

Query result

Key Value
FileName./usr/bin/rangen
FileSize10912
MD5AF82DC9DDA041261F4E241FCA01C7A7F
SHA-11426027C783689200B27C5A48199DFBF0F43AB6D
SHA-25628C11D3232466CE7699BEF0CA47D1B5A4F48FBDD93176DEC21DEF3102E629162
SSDEEP96:zBO8BWBk8KcQsxemcywFckaOD5qdqFp1makudtUInzkZwKcLG0+pqUri7SN6+359:zBZ88qemcywFckhZpQak4TnnLP+tF6
TLSHT10B32F84AFB49EE3BC0E84B3640AB532937784946D2D22313974C87723F97A5C4F558C6
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
FileSize138012
MD561E5A927918360930BD8B295BAAA1B71
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-10356C6E4FFCA00FA0505C089FAB7C22EAF3C4CD2
SHA-2564E189005087B72158F41D11645E9F80DC5CAA10BD6E73C5DF77725F4D57BE76A