Result for 3470766B1AB580B5D9A682F06B9BC3D661EB726B

Query result

Key Value
FileName./usr/bin/DB2arrow
FileSize71616
MD540EE99B3D0C36D21F1EE3496BF577185
SHA-13470766B1AB580B5D9A682F06B9BC3D661EB726B
SHA-256DEE8E73664F81E08BA017A8C99497A3FBD759AF482EFE1C42E2B70F432DBC454
SSDEEP768:IyyKmeJqvpLSK53/T3up7DooKyugbTkCbXta6XgU0dFEB8ne744F3mUEGtFPLMsV:IBKv8vYKxTepvovmk4b3KEvDRLLGdS
TLSHT126636D9DFA0EF957E283D37AEE8547307236618C930361D2790B535A768EAAC9EF1050
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
FileSize154116
MD504AE4680DCA7195817255462E3B2D04F
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-13B0510D6F20083B37C421B6B11C68A778719B9C6
SHA-2567D0C5CCC76471AC37C8D2895B2A7DF8F43C5FBDC6B439988410259FFBCA5A9D7