Result for 3B67D073975B3CB4A3319DC3606A134E765A599B

Query result

Key Value
FileName./usr/bin/rangen
FileSize10320
MD5A3A848607BA2D2DD35D68889EF3DBEF7
SHA-13B67D073975B3CB4A3319DC3606A134E765A599B
SHA-256E46B2350FD027C9536DD96D1CEE934233128B5B0E85C2AAF1C425BC3D4429372
SSDEEP96:t70B+BQ+0EXYyGqjUFAxhXAJgpqUrY0qlD888888888888880oAVW8hSO:twwht7jUKA+tBDo
TLSHT13D227349FB18E47FC0E907369A93477073725086E367A773724D82245F8376A6F616C2
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
FileSize183184
MD5BF923E85C90F8E770BBA6D2162E5ACC7
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.1+b1
SHA-11011C91FC167030A0902204ABD9FE81F5D3D8BEB
SHA-2566DED8CE19D0463CBDF0467EE07F2EC99D89810DFE9ECE9FAF06A185811796441