Result for 1E80CB141E652790DBD8A95391D95C5068C6D089

Query result

Key Value
FileName./usr/bin/DBstats
FileSize87544
MD5977E711C76FE626FA991F76EC3FDB0D6
SHA-11E80CB141E652790DBD8A95391D95C5068C6D089
SHA-256AA9E30B0A47D1F54BBB65249C42E850DD1E79EB58A268FF97C797EBF4F6A17BC
SSDEEP1536:ttRIpZtGEnGqVgyXbCMswX2l7NiWtCdoFw8UAlUZ5LzP:twzLGobCMPXS7Je
TLSHT165833B64BB83C4F0F39345F88289E36719319916F417F2A2FF063AD5753A2692E26371
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
FileSize197304
MD51535E9CCF2340817963470FD0F56D6E4
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+deb11u1
SHA-1E11E77DF9876282D542EEC90E45A17989D79FB11
SHA-2569E6FEE330746CDB275714712ED61FE134EB4FD3A6CB24F3E095B681F7D133D19