Result for 33E01697FD4F58963BB1C4DC6B89629BB23BEE16

Query result

Key Value
FileName./usr/bin/DBmv
FileSize74264
MD589306D76E7618E7203044018B7668B30
SHA-133E01697FD4F58963BB1C4DC6B89629BB23BEE16
SHA-2568B1F951801457CDA2A0F4F0F0C8D2F6CF5FD4C5CF7D44DA02280D4F7003C8234
SSDEEP1536:kt2xg3XYQtOWg5p5GbCQm9gjA/PzqnaVB/thhoBK+uq0MignjmMjsygpTiH2eXog:kt2xg3XYQtOWg5p5GbCQmGjA/PzqaVBi
TLSHT102730912AF18CFF6D0D7CCB0593ED34361FD6C8A426992B671FC8858BA5571A2AD38C4
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
FileSize148516
MD55A2EBA23139CFE5124B5E30CD5C3449D
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+git20180908.0bd5e07-1
SHA-17FB49EAADB02645C10EDE1B06115173E4149280E
SHA-256EAFF976CBB91044F84DD61067EBEF263B9AC987E873CAC7D1A19FFAE8D1B4001