Result for 1050BF3ECF209C40362774982BD61D06A51880CC

Query result

Key Value
FileName./usr/bin/DBdump
FileSize133136
MD5092D995F3996EA06F420C7DA978C4DF2
SHA-11050BF3ECF209C40362774982BD61D06A51880CC
SHA-256CF6B6CA6DF9D4F7C3C555C9781010F08AF174D0474E0A4C372B810395A62E6C8
SSDEEP1536:AIIq7au3bvKKmJ0rhbqwhHsbifV/FIXg2iNQO6XW8ukSExFhS:AIIq7auWBFIMG8XNiNQO2nS
TLSHT167D31727214C5B0EEB92387B478E6E5673A23C17037156E7B841036B6FAC739E60AD4D
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
FileSize171852
MD55146894761A3DF267C11528840D3B579
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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamedazzdb
PackageSectionscience
PackageVersion1.0+git20180908.0bd5e07-1
SHA-11B112F5EC2F41BD08B1B259A505DD6674B8360C6
SHA-256582E011ED60106C66E9A9931CD15A93F1F24653AE8556EF6E708FB37BE63B2A1