Result for 4312DD0FCF7121A92CC1154C64B802C0F1732D1F

Query result

Key Value
FileName./usr/bin/DB2fasta
FileSize69768
MD5F04E3E3526D618F07E86465D4AD365C1
SHA-14312DD0FCF7121A92CC1154C64B802C0F1732D1F
SHA-2564A629B7283BE162DAB12BB9F7A6E45B8745A79E1096EDB7338D3093E4DDF18C4
SSDEEP1536:7nthFX4sj+mWJvIm/YpHmNswndvBbCU7snPPXeKpiWei48d3G7VKsKopnc5e0:zthFXJj+mWJvIm/YpHmNswndvBbCU7at
TLSHT19C631A42AF1C1FE7C4CBCD700B3EC38325FE5C8642EA6676A5AC895C7A0571A5AD38C4
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
FileSize129286
MD5E0D0038725B91FA7E67BE38477A3981B
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+20161112-2
SHA-122D69893DB47B4A7CE6BEBADA59AAA9A5259A000
SHA-2568B9167747CCAD92D65A7D0E208E22F675DC6160CA75406291EDE7DB4F43B4928