Result for 237052CA1357E19A39F185FA87EB87C73814822A

Query result

Key Value
FileName./usr/bin/DBstats
FileSize133400
MD5920F7BA326DF67FCEFD8B9183511D264
SHA-1237052CA1357E19A39F185FA87EB87C73814822A
SHA-25608AE59189FAF4E96AC8EFDE794128BD93C27FD5E474DC438D5236509A75B0610
SSDEEP1536:OonRlBjLFsV8/c6o4zY5aqQ6u1JiLlKgKj1bWQAUcXTd10FH/V6Cpcjd:OIlBjRsV8/c740QX1JjrhbaXHSA
TLSHT1E2D33B17310C5F4CE786B87F43AE6E0273A53D470B2546567462432FAFADB2ACA1BD18
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
FileSize200504
MD5301D42C05AED189920479B51F25C9691
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-13CE10A3E8406E328373E55C4793B953D7C1A6E9A
SHA-25686CFE7B9DD9005FFFA53D3987C128D89BCF442FC976F0948028EBA1806F8AA6A