Result for 5DD8F14C0C2F7E556C95636AF183467E970B70DE

Query result

Key Value
FileName./usr/bin/DBwipe
FileSize133048
MD5CB051E9BC4096A8C70B9D7CFC7A5B30E
SHA-15DD8F14C0C2F7E556C95636AF183467E970B70DE
SHA-2567BBC3503FCD5692777C269761F51A6EBA2BFD62D2CADD51EEB8A69B714C00390
SSDEEP768:hIi2sq/wvnn9ECOhZ977MG5OhEgItGEdXkbE2GkjwkECO6oLIE4bmSJEwl:hcsKw/n9IhL7MPxEP2PjVEcE4bmS
TLSHT1E7D3F813364C5F46E7A2387B07CE3D10B3A47D56876147EAA500031BBFEAB39DA0E959
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
FileSize128812
MD5F42857C8AD1FCA5FCCEFA7AFA253BCBE
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+20161112-2
SHA-1249607B992403647FDE6E4A47AD4E40BC9B2617B
SHA-2568629978E8EC6D36F1EDBA0BE3E6367BB4E55115F40B29B84E0BA8006C724FF24