Result for 1086623EFBA22EA3E925792C3BCF6E2799199D1A

Query result

Key Value
FileName./usr/bin/quiva2DB
FileSize78456
MD5B3020C69C6A494904B42043440B8C0BC
SHA-11086623EFBA22EA3E925792C3BCF6E2799199D1A
SHA-25659827FDE03EB3EEFD71E170F376D97EF006C4D2B29B90AC6CEA5D0FB1259E260
SSDEEP1536:5MxYP6y3NXRSirwNGhCcXj63Gg7oGs9n9ayB3cgh/Yf3:KxNy3NXRts9g6Was9n9ayLQ
TLSHT1AB731912AF049EE7C4D7CC704A3DC75351FD9C8A46A6933671AC8A88BA1471B6FD38C8
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