Result for 4C3E3260B0DADDD4CF01EA1B875D0C6C19EE938F

Query result

Key Value
FileName./usr/bin/DBsplit
FileSize46512
MD5B8379003C8D24AA872CA8CB614C53324
SHA-14C3E3260B0DADDD4CF01EA1B875D0C6C19EE938F
SHA-256BD1E58042CEF233C33BA7C5C762D5E322A70AD4785DD1EE830E0691C92F7AC38
SSDEEP768:OLOhZY6eHy+BT/HgGyOIYFL9t6VNmKMU6AhsIBSHdbbG529eGUBF:gkY6UyJBo9t6VNtNjhw9h9
TLSHT15923AEC0F3C70427CFD652BA4E034CA6B99048CCB373CB9745568461786DB28AD37EA5
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
FileSize146520
MD5D291A5289DEC47A23C3B8CF5CD66F80D
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-1BC20E6F99184D7FB875595C18790FCE9FF8DC900
SHA-2564FCA471BFE1AAF9663196251B87B9DE497844E84F8F1C9A5A2A7845579294B3A