Result for 1B26826B46F718E453750AFD55502DAFA79501E0

Query result

Key Value
FileName./usr/bin/rangen
FileSize13796
MD5EF1F44A081768A0B9C002BC30D4DA696
SHA-11B26826B46F718E453750AFD55502DAFA79501E0
SHA-25696238ABD4E45559BA5A32B454BA94EFE00F58D5BE756BC5B8EFB3C14FC9003EA
SSDEEP96:+MbfaVB+BLX3Qa+8h2l1XAmYps1hzMCf6REr4vaPZopV5tmI0aLVX:fGwRX3Qes3XADwtfmaBop
TLSHT1BF522C16BF12EC32D2E2163C09971F196131882B93D393623F1663153A51D5C67B2BF2
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
FileSize217084
MD59968534CD8FC64CAED524606591AF27D
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+git20221215.aad3a46-1
SHA-155C471166C67EF69684075364F818BFA4DE7FA58
SHA-256ED63E626FEB238B1A8A13977C84EBCC48B3053CD6C671B751DC9AFAE22C57D49